There are 9 cells in the game that each can be empty, X, or O. So three states. That is 3^9 = 19683 maximum possible states of the game.
170MB seems like an awefull lot.
170MB seems like an awefull lot.
I think this is going to lead to a lot of redundant states, isn't it, because there are multiple paths to get to a particular board layout?
See my script here: https://news.ycombinator.com/item?id=38266987