Author: David Hanley
Date: 11:18:48 02/13/02
Go up one level in this thread
>All irrelevant, surely? > >The point is that simple tree search is useless in Go as you have a potential >branching factor of several hundreds at each ply. On a 9x9 board then maybe >it's a lot more likely, but certainly not for competition 19x19. Well--a tree search is needed, but surely it's going to be a heavily pruned one. That ought to make a hash table even more effective. dave
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.