Re: [computer-go] Solving Go

for small boards(2-5) in different first moves available in net like to see that. t. hArri - Original Message - From: Don Dailey [EMAIL PROTECTED] To: computer-go computer-go@computer-go.org Sent: Monday, November 12, 2007 8:39 PM Subject: Re: [computer-go] Solving Go Ok, on 2x2 I

Re: [computer-go] Solving Go

- *From:* Ben Lambrechts mailto:[EMAIL PROTECTED] *To:* 'computer-go' mailto:computer-go@computer-go.org *Sent:* Wednesday, November 07, 2007 9:03 PM *Subject:* [computer-go] Solving Go I want to create a perfect player on board sizes 3x3, 5x5 and maybe 7x7 and beyond. But I

Re: [computer-go] Solving Go

. t. hArri - Original Message - *From:* Ben Lambrechts mailto:[EMAIL PROTECTED] *To:* 'computer-go' mailto:computer-go@computer-go.org *Sent:* Wednesday, November 07, 2007 9:03 PM *Subject:* [computer-go] Solving Go I want to create a perfect player on board

Re: [computer-go] Solving Go

Message - *From:* Ben Lambrechts mailto:[EMAIL PROTECTED] *To:* 'computer-go' mailto:computer-go@computer-go.org *Sent:* Wednesday, November 07, 2007 9:03 PM *Subject:* [computer-go] Solving Go I want to create a perfect player on board sizes 3x3, 5x5 and maybe 7x7

Re: [computer-go] Solving Go

On 11/12/07, Don Dailey [EMAIL PROTECTED] wrote: Ok, on 2x2 I get a consistent result now that I implemented PSK. It gives the same result with SSK too. It's a 1 point win for the first player. I'm not sure this is in agreement with other peoples findings. But it appears to be

Re: [computer-go] Solving Go

] *To:* 'computer-go' mailto:computer-go@computer-go.org *Sent:* Wednesday, November 07, 2007 9:03 PM *Subject:* [computer-go] Solving Go I want to create a perfect player on board sizes 3x3, 5x5 and maybe 7x7 and beyond. But I have no idea how to start. How do I create the move

Re: [computer-go] Solving Go

://sourceforge.net/projects/narugo project and happy to co-operate. t. hArri - Original Message - From: Ben Lambrechts To: 'computer-go' Sent: Wednesday, November 07, 2007 9:03 PM Subject: [computer-go] Solving Go I want to create a perfect player on board sizes 3x3, 5x5 and maybe 7x7

Re: [computer-go] Solving Go

You could go the route chess does with egtbs. 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. -Josh On 11/7/07, Ben Lambrechts [EMAIL PROTECTED] wrote:

Re: [computer-go] Solving Go

I've put a lot of thought into this. 5x5 is about the largest feasible board size (currently) for creating an endgame database which is a table of all possible positions with the resulting score.I don't know if anyone has done this, but I know that this board size can be solved with brute

Re: [computer-go] Solving Go

Álvaro Begué wrote: On 11/7/07, *Don Dailey* [EMAIL PROTECTED] mailto:[EMAIL PROTECTED] wrote: [...] To go beyond 5x5, say 7x7 would require an endgame table with 3**49 entries or 239299329230617529590083 entries. This can be reduced by about 8x if you remove

Re: [computer-go] Solving Go

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

Re: [computer-go] Solving Go

I just ran my perm application for 4x4 and it's reporting 43,046,721 unique board states and took 2m6.980s. Will try for 5 and 6. seems you're computing 3**(n*n) 3**16 = 43046721 3**25 = 847288609443 3**36 = 150094635296999121 don't you want to exclude illegal positions? -john

Re: [computer-go] Solving Go

I just ran my perm application for 4x4 and it's reporting 43,046,721 unique board states and took 2m6.980s. Will try for 5 and 6. -Josh ___ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/