tic_tac_toe | A Tic Tac Toe game made on Ruby | Game Engine library

I am a beginner in Python, I know the code for TicTacToe is already available in the Internet but I would like to understand why it's not working the way I have written.

Please find the code below, the program works the problem is I am not sure how to announce if the game is Draw and if the box is already picked up by a player the other player should not use the same box by mistake, currently it can be overwritten.

I have programmed a game of n x n tic-tac-toe in Python and added a minimax search, which appears to work correctly. However, when I add alpha-beta pruning, the result of the search becomes dependent on the order in which nodes are visited.

In the minimax function shown below, if I add the line random.shuffle(node._children) after the call to node.create_children(), the result of the minimax search becomes unpredictable (I am testing this by running computer vs. computer games through the GUI and then diffing the resulting game files). However, if I delete the two if alpha >= beta: break statements, then the node shuffling has no effect on the result of the search.

I originally discovered this bug because I tried to sort the child nodes in order to improve the effectiveness of the pruning. Changing the order of the nodes in any way (reversing, sorting, shuffling, etc.) changes the result of the search, as long as those two if statements remain in place. This leads me to conclude that those if statements somehow cause the search to become dependent on the order in which nodes are visited.

The function is roughly based on this pseudocode. The primary difference is that my minimax function only serves to set the value of each node and does not return a value.

Below is the function definition. The full code is here (scroll up for class definitions). The minimax function is called by Tree.get_next_board (here), which is called from the GUI, whenever the engine makes a move. There is a fair amount of statefulness in the code that I would like to eventually reduce, but I am hoping there is a more obvious reason for the problems in my algorithm.

I working through a tutorial working on lists and using tic-tac-toe.

I am given a string like: XOXOXOXXO

And I'd like to convert this into a matrix or a list of list, for example:

tic_tac_toe= [[ 'X', 'O', 'X'], [ 'O', 'X', 'O'], [ 'O', 'X', 'X']]

I can get this as a 'list', but I can't get this as a list of lists.

I've been searching various posts, and one challenge is I see a lot that are 5 or 7 years old, and I have to wonder how relevant some of the answers still are, and I haven't been able to make work those prior recommendations.

I am creating a tic tac toe game where I would like the computer to go in strategic spots based on the available winning combos on the board. For some reason, the computer_index method works until turn_count == 4, where it outputs the entire WIN_COMBINATIONS array instead of just one value. Understandably, this creates an error in the valid_move? method. The relevant error and code are as follows.

I'm trying to show an image below a button only after the button has been pressed. My problem is that the fragment is shown immediately when the app is started and not only after the button has been pressed.

So I am experiencing a problem within this class assignment, we are set to code a "Tic Tac Toe" styled game. I thought it would be a good approach to have 2 versions such as original with 3 across and then 4 across. So here is the base class with the problem functions

Here is the minimal that leaves nothing cut out

main.cpp

I'm building a tic_tac_toe (board) game against AI computer player in java, i wrote a MiniMax algorithm for the computer. the width of the board can change like 3*3 OR 4*4. and

when i run the game with 3*3 board the computer player working very well, but when i tried 4*4 board, the computer player doesn't work it's just taking a lot of time in his turn and then nothing just waiting until i stop the game. And here is a screen shoot what's happening.

and here is the MiniMax algorithm that i wrote:

I am trying to follow an example in the Cucumber tutorial but it is written for Ruby and I am trying to write it in Java. I am having difficulty implementing the @When step as it requires me to update the DataTable and I am getting the following exception thrown,