Author: Dan Andersson
Date: 09:28:06 10/28/02
Go up one level in this thread
The main point I try to make is that the name null-move is somewhat of a misnomer in Go. Pass reduction pruning might be better. The recursive version might work well. But the main problem is the scoring function. You have to have a good one for the Pass-Pass move combination. And the opening is the most troublesome part in Go. As for missing pertinent variations in B*, the same problem exist in nullmove. It is only less likely to occur due to the fact that doing a move is superior in allmost all situations. And that the search depth that can be attained must be lower in B*. A modern B* implementation would be most interesting to behold IMO. It would certainly kick ass in slow endgames. The most popular misere games on the top of my head would be Nim and other pile games, low-ball poker and pass whist. MvH Dan Andersson
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.