next up previous
Next: About this document ...
Up: Conventional AI: Search
Previous: Other references on search

Further reading --- game trees

I omitted this from the readings above. If you're interested, look at the following sections of the OU book:

4
Game playing
4.1
Look-ahead tree.
4.2--4.4
Games and minimaxing.
4.5
The horizon effect.
4.6
Strategic programs.
4.7
Comparison with humans. De Groot, Chase and Simon, Eisenstadt and Kareev (the latter is the reference on representations in Go and Go-Moku I mentioned last time).

There's a nice half-page explanation of minimaxing in Chess playing programs and the problem of complexity by A Newell, J C Shaw and H A Simon, in Computers and Thought edited by E A Feigenbaum and J Feldman: RSL; Psychology: KH:F.

For a discussion of the limitations of minimaxing, look at the article by Berliner in Thinking --- Readings in Cognitive Science, edited by P.N.Johnson-Laird and P.C.Wason (CUP, 1977).



Jocelyn Paine
Tue Jun 3 11:15:49 BST 1997