[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [computer-go] Testing move generation and tree traversal
Hi Peter,
The difference in our numbers is that I am counting total legal moves in the tree and
you are counting end node positions.
When I make the program only count end nodes (positions that result in
depth == 0 in my code) I get the same number up to 4 ply. (Still
waiting on 5 ply.)
depth: 1 count: 81
depth: 2 count: 6,480
depth: 3 count: 511,920
depth: 4 count: 39,929,136
- Don
Hi All,
In computer chess there is a thing called perft
(http://homepages.caverock.net.nz/~peter/perft.htm) for testing the move
generation and tree traversal functionality of a chess program.
Has anyone done this in Go?
I've been working on a Go program and would like to verify that my core code
is working OK. It does incremental updating of chains etc so there is a
fair chance of bugs :-)
According to my program, for 9x9 Go, there are:
81 ways of playing a 1ply game,
6,480 ways of playing a 2ply game,
511,920 ways of playing a 3ply game,
39,929,136 ways of playing a 4ply game,
3,074,496,080 ways of playing a 5 ply game.
Oh, that is excluding passing at all nodes. Maybe its a bad idea to exclude
pass moves? But I thought it would make things simpler and it meant I
didn't have to think about what to do after 2 consecutive passes.
Similarly for 5x5 Go there are 2,411,088,112 ways of playing a 7ply game.
Is anyone able to verify those numbers?
cheers,
Peter McKenzie
_________________________________________________________________
Is your PC infected? Get a FREE online computer virus scan from McAfeeŽ
Security. http://clinic.mcafee.com/clinic/ibuy/campaign.asp?cid=3963
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/