I am sure that it is good, can't compare node counts for anything which uses
any static knowledge.
2282 is current count and you can increase or decrease those
proofCounter/disProofCounter limits and it still
works but don't know exactly when it is doing it right.
t. hArri
----- Original Message -----
From: "Dave Dyer" <[EMAIL PROTECTED]>
To: "computer-go" <computer-go@computer-go.org>
Sent: Thursday, December 13, 2007 5:52 AM
Subject: [computer-go] RE: Microsoft Research Lectures: Akihiro Kishimoto
My tsumego applet determines without a search that black can kill,
and white might live if he moves first.
http://www.andromeda.com/people/ddyer/go/shape/ShapeApplet.html
A table lookup is a little better than searching 162438 nodes :)
> 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
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
