Let me start by noticing, I am not interested in playing a game of Tic Tac Toe, nor programming any form of "AI". With that out of the way, let me give some background:
I have found Rust, with its ownership model, frequently nudges me to rethink whatever I am building. Usually it involves fixing some structs / enums, to avoid references. Correctly structuring an object can make me avoid lots of headaches later when I actually add functionality.
One thing I noticed that helps is understanding what kind of properties should the data have? Should it maintain a certain order, or can it be unordered? Are all of the values unique, or can it have duplicates? All of these details are very important. It is wrong to just shove everything into a Vec. A Vec implies ordering and duplicates, which could be a bad model. We need to choose something which most closely represents the data.
Ok, enough lecture. Onto the Tic Tac Toe grid. Observing this grid provides me with a few important properties:
A Tic Tac Toe grid can be rotated clockwise or counterclockwise, and the game is still the same. The grid can also be flipped over horizontally or vertically and the game will be the same. To decide if anyone won, we just need to see if any rows have 3 of the same value. The rest of the grid does not matter.
I am trying to figure out the best memory model would best represent this behavior. How to build a grid whose orientation does not matter?
Ideally, all of these values should be represented in memory exactly the same way:
X|O| X| | | |
|O| = O|O| = O|O|
| | | | X| |
But how to do this? One way I was thinking, is perhaps instead of saving a grid at all, we should just be keeping track of all of the rows.
- [X, O, E] (E = Empty)
- [O, O, E]
- etc for all the other rows..
However there are several problems with this model:
- The same cells are owned by multiple rows. This is not good. Perhaps the rows can hold a reference to the cells?
- The ordering of each row should not matter. So this shouldn't be an array. A better representation may be a Set or Bag/Multiset.
#1 continues to bug me. If we have rows holding references to all of the cells, then it will be hard to update any of them because of rust's restrictions on multiple mutable borrows. Or am I wrong here? How can I update a cell using a reference from a row? Where would the cell live anyway?
It doesn't seem to help to declare the rows inside of the cells, because that leads to cyclical references.
I continue to mull over this problem with not much success. I hope someone can help me discover a better path forward.
A simple vector seems fine. Each item in the vector is an enum representing cell state. You can translate x y coordinates to an index pretty easily.
Nothing wrong with that. My idea was to do a vector (or fixed-size array if you prefer) in one dimension. An example would be something like [0, 1, 2, 0, 1, 0, 2, 0, 2] (where O is 1, X is 2 and 0 represents an empty cell). The math to get the index is similar to this:
https://bfnightly.bracketproductions.com/chapter_3.html#building-a-simple-map
Might be overkill for a simple tic-tac-toe game, but if you want to rotate the board or whatever, you can just change the math you do to get the index. I'm not at all a math expert, but it seems like a reasonable approach.