Re: computer-go: Deep search = worst play ?

[Joan Pons Semelis <joan@xxxxxxxxxxxxxxxx>]

My assumption is that the programs that found that deepening
the search brough worst play have a very narrow search and
widening it at the cost of depth would improve their level.

Joan

From: Vincent Diepeveen <diep@xxxxxxxxxxxxxxxxx>
>What is your assumption in short?

>Of course a deeper search will always help. If it doesn't
>help then there is a bug in the programs search or eval design.

>Usually evaluation functions are very bad debugged, so are searches,
>apart from that there are typical qsearch problems and hash problems.

>Most hash still with 32 bits, which is very bad. Even 64 bits is a 
>bit little.