Implemented Monte Carlo Search Tree! It's INCREDIBLY thick though. Needs some debugging
Aha! Found the problem - it wasn't correctly detecting win conditions
Made the simulation much smarter in assuming that a player - either AI or player - will always exploit an available win condition
Added colors so it's a tiny bit easier to see what's going on
Made the AI a bit loss-averse
Fixed bug where diagonal victories could be falsely reported
Fixed bug where AI might not recognize a win condition
Made "X's turn" display dependent on symbol, not player; makes it easier to play the computer against itself
AI now no longer considers the fact that a player may pass up an opportunity to win.
Fixed another victory false positive
Cleaned up debugging code. I think we're almost done here!