Re: [computer-go] winning a won game

2007-12-07 Thread Heikki Levanto
On Thu, Dec 06, 2007 at 06:39:17PM -0500, Chris Fant wrote: > > I propose a far more powerful and correct set of rules: > 1. Play the move that gives you the best chance of winning. That would be lovely - if we had a good way of estimating those chances. It is (should be) well known that MC pla

Re: [computer-go] winning a won game

2007-12-06 Thread Nick Wedd
In message <[EMAIL PROTECTED]>, terry mcintyre <[EMAIL PROTECTED]> writes I am hardly fit to clean the dust from Pro 9-dan Go Seigen's goban, so I'll just rest my argument What _is_ your argument? Nick with the chapter headings from his book, Winning a Won Game: Chapter 1 Three Golden Rules

Re: [computer-go] winning a won game

2007-12-06 Thread Don Dailey
Hi Terry, How to convert these maxims to robust code? Use monte carlo with win/loss scoring as we do now.These maxims fit the monte carlo scoring model perfectly. - Don terry mcintyre wrote: > I am hardly fit to clean the dust from Pro 9-dan Go Seigen's goban, so > I'll just rest my argu

Re: [computer-go] winning a won game

2007-12-06 Thread Chris Fant
I propose a far more powerful and correct set of rules: 1. Play the move that gives you the best chance of winning. Unfortunately, that it not very helpful for humans. Luckily it is helpful for a UCT engine or a similar best first + MC engine. On Dec 6, 2007 6:29 PM, terry mcintyre <[EMAIL PR

[computer-go] winning a won game

2007-12-06 Thread terry mcintyre
I am hardly fit to clean the dust from Pro 9-dan Go Seigen's goban, so I'll just rest my argument with the chapter headings from his book, Winning a Won Game: Chapter 1 Three Golden Rules Avoid uncertainties when you have the lead Seize the opportunity when it is presented Attack the oppon