RE: [computer-go] RE: Microsoft Research Lectures: Akihiro Kishimoto
Many faces still finds the correct move on the first trial, but now it takes 74 nodes to prove the first move works, rather than one node. It looks at a total of 114 nodes to prove that no other move works. David -Original Message- From: [EMAIL PROTECTED] [mailto:computer-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. 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 better so it comes more useful. 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/ ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
Re: [computer-go] RE: Microsoft Research Lectures: Akihiro Kishimoto
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/
Re: [computer-go] RE: Microsoft Research Lectures: Akihiro Kishimoto
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 better so it comes more useful. 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/
