11–15 of 15 posts
Earlier quoted context omitted.
Thanks a ton! I will tighten it up! Hopefully, you will pull the next release and try to beat it again. I do hope it was not a complete pushover.....
Ok!!! Round 2! Any challengers?
Earlier quoted context omitted.
That is not a bug. It is there because these locations are just not initialized. How did you manage to beat the cpu? Can you remember the last state of the game board which led to your victory? Thanks.
It was unexpected by me so I consider it a bug. You're encoding the game state as a giant switch statement. This is not the best approach. The size of your code will increase exponentially with the complexity of the game. The only reason it works at all is because tic-tac-toe is very simple. You should read up on representing this as a game tree: http://en.wikipedia.org/wiki/Game_tree http://en.wikipedia.org/wiki/Ext…
http://github.com/RichardBronosky/Tic-Tac-Toe
The forked network for this project is interesting. Is this for a class or something?
Check out http://en.wikipedia.org/wiki/Tic-tac-toe#Strategy for the description of the algorithm.
Also you neglected to mention the most interesting part of this: http://github.com/RichardBronosky/Tic-Tac-Toe The forked network for this project is interesting. Is this for a class or something?