ter-go-
> [EMAIL PROTECTED] On Behalf Of Harri Salakoski
> Sent: Wednesday, December 12, 2007 9:04 PM
> To: computer-go
> Subject: Re: [computer-go] RE: Microsoft Research Lectures: Akihiro
> Kishimoto
>
> 5 ...
> 4 WW.
> 3 BBB..W.
> 2 ...B.W.
> 1 ..B..W.
> A
5 ...
4 WW.
3 BBB..W.
2 ...B.W.
1 ..B..W.
ABCDEFG
Ha, I give blacks more room to play, and shape database did not find it, or
maybe I used it wrong :).
But this search find B2 now in 1258437 nodes :| which is quite much and
takes couple seconds.
Don't know but really hope it goes bett
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 Messag
