On Friday 10 December 2004 03:23 pm, James Edward Gray II wrote:
| On Dec 10, 2004, at 2:15 PM, Brian Schrder wrote:
| > Well, the evalutation routine -100 for lost, +100 for won, 0 otherwise
| > is not
| > really a evaluation routine, and minimax with alpha beta pruning can
| > search the whole problem in 6-7s on my machine.
|
| So what is your program learning at this point and thus how do you
| justify it as a valid solution?  ;)
|
| James Edward Gray II

Does it have to learn how to play tic-tac-toe? Or just how to win?

T.