PhiloComp.net

Talks on AI Games Programming

An Algorithm for Playing Noughts and Crosses

This is a talk prepared for the UNIQ Summer School in July 2020, lasting just under 13 minutes. It explains the recursive logic of the move evaluation function within the Noughts and Crosses examples program in Turtle System, but does so in general terms, without examining the program code itself. A future talk is planned to go through the code in detail.

For a handout containing the talk slides, click on one of the following links: