Initial commit
Changed children= to add_child
Changed board from 3x3 to 1x9
Fix build_tree method

Added 2 techniques to reduce tree size:

- Until the tree reaches 2500 nodes in size, build_tree searches the
  entire tree for a duplicate of any node it's about to add, then
  points the new node there rather than adding a new one.

- Stops looking for children on a winning board.
Change conditions of excluding boards in the tree

Don't exclude a board because one of its siblings is a winning board.
That behavior will be saved for the computer player when the game is
running.

Instead, check each added node to see if it's a winning board, and
then exclude its children from being added as appropriate.

Roughly doubles the amount of nodes in the tree, but allows the
tree to represent games in which the player's didn't play perfectly.
Add find_next_board method

Simple search function that finds the immediate child of a node whose
game grid matches the one passed to the method.
Remove testing comments
Remove test comments/code
Move tree generation to class constructor

Tree is generated on TTT.new, and the starting player (required for
the tree to be accurate) is now a constant
Move tree gen again to initializer

The TTT class now generates a new tree on each initialization,
however the same TTT instance can play consecutive games without
having to rebuild the tree.
Improve AI play, isolate game init in separate method

The computer players will now prefer corners if they're available and
aren't a losing move.
Deleted extraneous files

- ttt.rb and computer.rb: Previous non functional versions
- parse.rb and ttt.out: Files related to debugging the program
Merge branch 'master' of github.com:TooManyBees/aa-assignments

Pretty sure I'm just grabbing a README