Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.


Messages - Scipi

Pages: 1 ... 67 68 [69] 70 71 ... 139
1021
Miscellaneous / Re: What was your first Omnimaga post?
« on: March 28, 2012, 01:50:31 am »
Hi I just joined. The site looks impressive!  ;D

Can someone email me the Nspire OS v 1.7? My email is [email protected]

Thx.

Surprising. I forgot I joined due to Ndless (The first one, that is) XD

EDIT: http://ourl.ca/7017/116655

1022
Miscellaneous / Re: What is the color of your nick on OmnomIRC?
« on: March 27, 2012, 11:45:50 pm »
Dark Green! :D

Yayz, my favorite color! :3

1023
TI Z80 / Re: Core Wars
« on: March 26, 2012, 10:03:18 pm »
Ah, true. I suggested that because I would like to personally see something emerge I like to call an "Unpacker" which would basically deploy itself as several subprograms and could even have code to restore itself if it becomes damaged. (XD)

Although I guess that is still possible to do, it would just take a long time to run.

1024
TI Z80 / Re: Core Wars
« on: March 26, 2012, 08:33:28 pm »
We should hold a monthly tournament, definitely. :D

(What if we had several sections as well with modified rules? Say, processes in one might all run at the same time no matter how many a program has?)

1025
Miscellaneous / Re: Birthday Posts
« on: March 26, 2012, 01:03:47 am »
It's that time of year again for me >:D

(Also, necro?? In this thread?!) :P

1026
Humour and Jokes / Re: How to WIN the game
« on: March 25, 2012, 11:09:21 pm »
If the objective of the Game is to lose, then by losing, does that mean you win?

1027
TI Z80 / Re: Essence
« on: March 25, 2012, 07:27:26 pm »
* HOMER-16 lost O.O

1028
Computer Programming / Re: array help
« on: March 25, 2012, 07:21:46 pm »
Well, for your code what you could do instead is use

Code: [Select]
int sr = 0;
            for(int i = 0; i < winpattern2.length; i++)
            {
                   for(int bb = 0; bb <= 2; bb++)
                   {
                       for (int c = 0; c <= 2; c++)
                       {
                           if ((ss[c][bb] == 0) && (winpattern2[i][c][bb] == 0))
                           {
                                sr += 1;
                           }
                       }
                   }
                }
                   

Although that part should work because it's basically making farray a reference to each array of arrays within the winpattern2 array.

This is the code I wrote to find if who won or of it's a tie for any Tic Tac Toe Game.

(It's actually a portion of a would-be larger tic tac toe class)

Code: [Select]
package cwk09;

/**
 *
 * @author HOMER-16
 */
public class TicTac {
    private String[][] grid;

    public String[][] getGrid() {
        return grid;
    }

    public void setGrid(String[][] grid) {
        boolean valid = true;
        if(grid.length == 3){
            for(String[] i : grid){
                if(i.length != 3){
                    valid = false;
                }
                for(String n : i){
                    if(!(n == "X" || n == "O" || n == " ")){
                        valid = false;
                    }
                }
            }
            if(valid){
                for(int i = 0; i < grid.length; i++){
                    System.arraycopy(grid[i], 0, this.grid[i], 0, grid[i].length);
                }
            }
        }
    }
   
    public TicTac(){
        grid = new String[3][3];
        for(String[] i : grid){//i holds a pointer to a String array
            for(int n = 0; n < i.length; n++){
                i[n] = " ";
            }
        }
    }
   
    public void set(int x, int y, String character){
        if((x >=0 && x < 3 && y >=0 && y < 3) && (character == "X" || character == "O")){
            if(grid[x][y] == " "){
                grid[x][y] = character;
            }
        }
    }

    public String ticTacWin(){
        for(int i = 0; i < grid.length; i++){
            String val = grid[i][0];
            if(grid[i][1] == val && grid[i][2] == val){
return val;
            }
        }
        for(int i = 0; i < grid.length; i++){
            String val = grid[0][i];
            if(grid[1][i] == val && grid[2][i] == val){
                return val;
            }
        }

        if((grid[0][0] == grid[1][1] && grid[2][2] == grid[1][1]) || (grid[0][2] == grid[1][1] && grid[2][0] == grid[1][1])){
            return grid[1][1];
        }

        return " ";

    }


    public String toString(){
        String gridString = "";
        for(int i = 0; i < grid.length; i++){
            for(int n = 0; n < grid[i].length; n++){
                gridString += grid[i][n] + ((n < 2) ? "|" : "\n");//Conditional for formatting purposes only
            }
            gridString += ((i < 2) ? "-----\n" : "");//Conditional for formatting purposes only
        }
        return gridString;
    }

}

Hope that helps :)

1029
News / Re: Lua print restored in OS 3.1
« on: March 24, 2012, 10:43:39 pm »
And the problem is, serial communication definitely has valid uses for classrooms, so by crippling their Lua (intentionally or not) and by fighting native code, they're doubly hurting themselves...

Why do I keep thinking that the only effective way to deal with TI is to hurt them financially such as a boycott on buying new nspires (used is ok because ti doesn't get that money) and pressure on teachers to put the toys away and go back to teaching/learning math again? 

I would rather think that enticing Casio to produce superior products and not doing anything to make them want to lock down their calcs would be a more viable option. Just let TI hurt themselves, really. But that will only happen if there is reason to switch to Casio. Right now the development community is still focused on TI because there are more programs for it, thus more users, thus more programs are developed by said users. It's a cycle that feeds into itself. If, however, Casio developers started cropping up more and released high quality software (which they already do), that coupled with, perhaps, a more powerful calc from Casio could start siphoning off TI's userbase and start its own cycle of growth.

Besides, who says we need to fight TI. We can't really beat them anyways, we're only a minor portion of their profit margins, sadly enough. The best we can do is help Casio grow to surpass TI and not make them dislike us in doing so.

1030
TI-Nspire / Re: IRC on the Nspire
« on: March 24, 2012, 05:27:39 pm »
O.O

That's impressive!
* HOMER-16 wonders if this will go like gCn and Gossamer and well eventually see an internet browser for the Nspire. :P

1031
Computer Programming / Re: array help
« on: March 24, 2012, 04:53:53 pm »
In Java, all a 3D array is, is an Array of arrays of arrays. As such, the declaration of one would look like this.

Code: [Select]
int[][][] myArray;
//or
int[][][] myArray2 = {{{0,0},
                       {0,0}},
                      {{0,0},
                       {0,0}}};//Creates a 2x2x2 array filled with 0

You can compare a 3D array to a 2D one with, say, a function compare(). compare() would have two arguments both 2D arrays. Here's how you would use it.

Code: [Select]
int[3][3] my2DArray;
int[3][3][3] my3DArray;

for(int[][] i : my3DArray[]){
    compare(i, my2DArray);
}
On a side note, having a 3D array holding all possible winning combinations is quite inefficient. If you want I could give you my own code that finds any winning combination that I had to do as an assignment in my Java class. :) You could use it to study from as well, if you wish.

1032
Computer Projects and Ideas / Re: [Contest] System Crash
« on: March 23, 2012, 11:06:46 pm »
Oh phew, I thought your contest entry was an evil plot to crash everyone's computers :P I guess this is more fun. Congrats on the win!

 :evillaugh:

Thanks :D

1033
TI Z80 / Re: My Digital Clock
« on: March 23, 2012, 02:43:45 pm »
That's impressive that you got it able to update every 1 second, accurately. :D

1034
ASM / Re: Ok, I'm a noob
« on: March 23, 2012, 02:42:45 pm »
You could have a jump back to the conditions (I don't remember much from HotDog's tutorials, but I think you could also just place a ret after each so it automatically returns to where it was before)

Unless I'm thinking of something different...

1035
TI Z80 / Re: Essence
« on: March 23, 2012, 02:39:13 pm »
In that screenie before your latest one, are those Japanese characters? If so, what do they say? :P

(I have a feeling that they make me lose, for some odd reason) D:

Pages: 1 ... 67 68 [69] 70 71 ... 139