Crazy Python solution – 79 characters max([b[x] for x in range(9) for y in range(x) for z in range(y) if x+y+z==12 and b[x]==b[y]==b[z]] + [0]) However, this assumes a different order for the board positions in b: 5 | 0 | 7 —+—+— 6 | 4 | 2 —+—+— 1 | 8 | 3 That … Read more
Here is a simple implementation of a minimax algorithm for Tic Tac Toe in JavaScript. The search tree deepens until a game-over state is detected. If a win is detected, then the current player cannot play, and so the static value is negative (-10). If a draw is detected the returned value is 0. In … Read more
The strategy from Wikipedia for playing a perfect game (win or tie every time) seems like straightforward pseudo-code: Quote from Wikipedia (Tic Tac Toe#Strategy) A player can play a perfect game of Tic-tac-toe (to win or, at least, draw) if they choose the first available move from the following list, each turn, as used in … Read more
Class names should normally use the CapWords convention. The name of the class should be Button rather than button. Instance Variables should be lowercase. Hence the name of an object of the typ Button should be button. Furthermore use a pygame.Rect object and collidepoint. See How do I detect if the mouse is hovering over … Read more
You know a winning move can only happen after X or O has made their most recent move, so you can only search row/column with optional diag that are contained in that move to limit your search space when trying to determine a winning board. Also since there are a fixed number of moves in … Read more
if (currentstate == you_win){ System.out.println(“‘X’ Won!!”); else if (currentstate == comp_win) System.out.println(“‘O’ won!!”); else if (currentstate == draw) System.out.println(“It’s a Draw :(“); } Take a look at this line (and I removed some extraneous code to make this easier to see): if (currentstate == you_win){ else if (currentstate == comp_win) //… } Looking at it … Read more
U could use return to end function execution.
Just taking your question as it is, I can imagine two ways I’d do it without getting too fancy. The first one would be to use two arrays. One for holding the numbers (and int array), one for holding the player input (a char array holding “x” and “o”). This could look like this: public … Read more