On Dec 10, 2004, at 1:42 PM, Brian Schröäer wrote:

> In this case, would a minimax-a/b algorithm be teaching the ai a 
> strategie?
> Tic-Tac-Toe is so shallow, it can be searched completely by 
> minimax-a/b, so
> this would be a one-page solution.

While you could argue that a minimax search has nothing to do with 
Tic-Tac-Toe strategy, I doubt you would convince me on the evaluation 
routine a minimax search requires.  Now if your program learns how to 
evaluate positions over time...

James Edward Gray II