On 11/7/07, Joshua Shriver <[EMAIL PROTECTED]> wrote: > > You could go the route chess does with egtbs.
That won't work for go. First of all, chess and checkers are games where the position on the board becomes simpler at the end of the game, so many games will end up converging on positions for which you can make a database. First permutate every possible board with both stones, and start > removing pieces one at a time. I wrote a permutation tool, but even with 3 and 4 size board the end > data file was huge. Not only that; you seem to assume that you can assign a win/loss score to a position, but you also need to consider the prior history of the board so you can enforce the super-ko rule correctly. These limitations make using egtbs hopeless for go. Álvaro.
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
