undo func in a tic tac toe game

I want to program a version of the Tic-Tac-Toe game using C, in which we have 'n × n' board decided by the user, and the loser is decided by the first who get first 'n' X's or O's in a row or column etc..

One of the requirements is to let the players be able to undo multiple steps, that means to get back to the board status as it was a couple of steps ago by entering a negative odd number.

For example, if player 1 entered '-3' as the row index, the game needs to revert back how it was 3 steps before (in case there has already been 3 steps done within the game), show the board and give the turn to player 2.

Any idea how I would be able to make such a function ill be very thankful if someone do it for me its just my 4th week with c https://dreamincode.net/forums/publi...helpsmilie.gif

Thanks!

Cross-posted here -> Undo Func In Tic Tac Toe Game - C And C++ | Dream.In.Code

Quote:

---

Originally Posted by moradkh

I want to program a version of the Tic-Tac-Toe game using C, in which we have 'n × n' board decided by the user, and the loser is decided by the first who get first 'n' X's or O's in a row or column etc..

One of the requirements is to let the players be able to undo multiple steps, that means to get back to the board status as it was a couple of steps ago by entering a negative odd number.

For example, if player 1 entered '-3' as the row index, the game needs to revert back how it was 3 steps before (in case there has already been 3 steps done within the game), show the board and give the turn to player 2.

Any idea how I would be able to make such a function ill be very thankful if someone do it for me its just my 4th week with c https://dreamincode.net/forums/publi...helpsmilie.gif

Thanks!

---

Undo is always difficult to program. The easiest way is to have a list of all previous states. Fortunately a tic-tac-toe board is only a few bytes, so there's no real issue in memory or performance.

Maximum number of moves is nine, so you need a stack with a capacity of nine boards. When a move is made, push the stack. When an undo is made, pop it and set stack top to the current board.

Quote:

---

Originally Posted by Malcolm McLean

Undo is always difficult to program. The easiest way is to have a list of all previous states. Fortunately a tic-tac-toe board is only a few bytes, so there's no real issue in memory or performance.

Maximum number of moves is nine, so you need a stack with a capacity of nine boards. When a move is made, push the stack. When an undo is made, pop it and set stack top to the current board.

---

With a game like tic-tac-toe (or even one like chess), you only need to store the moves themselves as board locations (like (0,0)) in the undo stack, rather than a whole copy of the board. To undo a move, pop off the top move from the stack and remove the player's mark from the location indicated by the move.