Re: [computer-go] An [open] question on game tree search theory

[Tapani Raiko <praiko@xxxxxxxxx>]

> See: http://www.cs.umd.edu/~nau/papers/pathology-aaai80.pdf
This made me think, that depth n minmax search can also be seen as having 
an opponent model: depth n-1 minmax search! When letting a single chess 
program play with depths n and n-1 against each other (Figure 4, left 
subfigure), depth n has a perfect model of the opponent, and therefore it 
is reasonable that it will win very often. The curve might look different 
if different programs were compared.

Regards,
--
 Tapani Raiko, <tapani.raiko@xxxxxxxxxxxxxxxxx>, +358 9 451 4468, +358 50 522 5750
 http://www.cis.hut.fi/praiko/
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/