Re: [computer-go] Sylvain's results

2007-04-11 Thread dave . devos
During last year i played a dozen of 9x9 games against a 1d (on a turn based site) and won 50% (and I don't think it will improve much if I played some more games). On 19x19 my winning percentage against the same player during the same period was 95% over dozens of games. (all even games with

Re: [computer-go] an idea... computer go program's rank vs time

2007-01-23 Thread dave . devos
- Oorspronkelijk bericht - Van: Matt Gokey [EMAIL PROTECTED] Datum: maandag, januari 22, 2007 9:59 pm Onderwerp: Re: [computer-go] an idea... computer go program's rank vs time Nick Apperson wrote: He is saying this (I think): to read m moves deep with a branching factor of b

Re: [computer-go] an idea for a new measure of a computer go program's rank.

2007-01-21 Thread dave . devos
- Oorspronkelijk bericht - Van: Ray Tayek [EMAIL PROTECTED] Datum: zondag, januari 21, 2007 4:18 am Onderwerp: Re: [computer-go] an idea for a new measure of a computer go program's rank. also i suspect that at least 33% of the moves (at my 1-dan level) are wrong (what you

Re: [computer-go] an idea for a new measure of a computer go program's rank.

2007-01-21 Thread dave . devos
- Oorspronkelijk bericht - Van: Don Dailey [EMAIL PROTECTED] Datum: zondag, januari 21, 2007 7:02 pm Onderwerp: Re: [computer-go] an idea for a new measure of a computer go program's rank. By the way, can I assume that in world champion GO matches they use fast time

Re: [computer-go] an idea for a new measure of a computer go program's rank.

2007-01-20 Thread dave . devos
- Oorspronkelijk bericht - Van: Don Dailey [EMAIL PROTECTED] Datum: zaterdag, januari 20, 2007 9:06 pm Onderwerp: Re: [computer-go] an idea for a new measure of a computer go program's rank. Years ago A player in the chess club kept beating me over the head with a

Re: [computer-go] an idea for a new measure of a computer go program's rank.

2007-01-18 Thread dave . devos
In my opinion lowering the time limit just forces players (human and computer) towards random play. I am sure there exists a time limit where a random playing program can beat Lee Chang-Ho 50% of the time. But what is the use of that? To me it sounds like an invention to be able to show some

Re: [computer-go] Can Go be solved???... PLEASE help!

2007-01-12 Thread dave . devos
And Mark Boon also neglected the future use of wormholes, replicators and who knows what? :) Sorry, but how do you what future quantum computers can churn so much data? 10^400 is a rediculously large number. Even if you multiply the volume of the visible universe expressed in in cubic Planck

Re: [computer-go] Re: Interesting problem

2007-01-05 Thread dave . devos
In our club we estimate twice the komi for sente equal to a handicap stone, except for the first handicap stone one, which is just one time the komi. Using a komi of 6.5 for sente amounts to: Hand. Value 1 = 6.5 2 = 19.5 3 = 32.5 4 = 45.5 5 = 58.5 6 = 71.5 7 = 84.5 8 =