[computer-go] Microsoft Research Lectures: Akihiro Kishimoto

[Alain Baeckeroot]

Le mercredi 12 décembre 2007, Harri Salakoski a écrit :
> Such comment just take my word back little it is maybe awesome but I can't
> say is it or not, as have still bugs left.
> 
> E E EEEEE
> E E EEEEE
> BBBBBEE
> WWWEBEE
> E E EWBEE
> E E WEBEE
> ABCDEFG
> For example current version(not released) goes trought 162438 nodes before
> it proofs black B2 kills(without any ordering help).

 . . . . . . .
 . . . . . . .
 B B B B B . .
 w w w . B . .
 . . . w B . .
 . . w . B . .
 A B C D E F G

with 7 empty places, should'nt it be less than 7**3 = 2187 ?

How much nodes does it uses for this ?
 B B B B B B B
 B B B B . B B
 B B B B B . B
 w w w . B B B
 . . . w B B B
 . . w . B B B
 A B C D E F G

Alain