| View previous topic :: View next topic |
| Author |
Message |
Vincent Diepeveen
Joined: 09 Mar 2006 Posts: 1738 Location: The Netherlands
|
Post subject: Re: A Go algorithm for chess programmers to try ? Posted: Sun Jun 03, 2007 2:48 pm |
|
|
| Rémi Coulom wrote: |
| diep wrote: |
You are NOT going to implement in Le Fous Fous (the crazy bishop) something that is in advance going to lose for you. |
I really believe it could work. Not Monte-Carlo chess, of course. But I was under the impression that using domain knowledge to prune or reduce late moves is a good idea. I am not following computer chess that much, but I believe some do it already. I think the algorithm in my paper would be a very good tool to design such pruning or reduction heuristics.
Rémi |
Abstract:
"....A 19×19 Monte-Carlo program improved with these patterns reached the level of the strongest classical programs."
You seem total ignorant that your paper reports nothing new wasn't it that you combined it with monte carlo method. Remove the word "monte carlo" out of your paper and you basically claim something that already gets used for 30 years in computer chess.
Apart from that i'll have to dissappoint you that if in diep i just see tactics deeper, that it doesn't play better at all. Experiments showed a score reduction over 1000 games against other programs at slow time controls (40 in 2 hours), an experiment that has eaten quite some system time you can say, a score reduction of 20-25% against commercial programs.
that is about 140-200 of reduction in elostrength when just seeing tactics deeper last few plies.
In Go that still works because programs are tactical that pathetic bad as of today that all their mistakes still can be seen as tactical mistakes. |
|
| Back to top |
|
 |
|
| Subject |
Author |
Date/Time |
A Go algorithm for chess programmers to try ? |
Rémi Coulom |
Sat Jun 02, 2007 8:32 pm |
Re: A Go algorithm for chess programmers to try ? |
RVisitor |
Sat Jun 02, 2007 8:44 pm |
Re: A Go algorithm for chess programmers to try ? |
Daniel Mehrmann |
Sat Jun 02, 2007 8:57 pm |
Re: A Go algorithm for chess programmers to try ? |
Vincent Diepeveen |
Sun Jun 03, 2007 2:05 pm |
Re: A Go algorithm for chess programmers to try ? |
Rémi Coulom |
Sun Jun 03, 2007 2:18 pm |
Re: A Go algorithm for chess programmers to try ? |
Vincent Diepeveen |
Sun Jun 03, 2007 2:48 pm |
Re: A Go algorithm for chess programmers to try ? |
Dann Corbit |
Tue Jun 05, 2007 6:58 pm |
Re: A Go algorithm for chess programmers to try ? |
Dan Andersson |
Wed Jun 06, 2007 7:21 am |
Re: A Go algorithm for chess programmers to try ? |
Rémi Coulom |
Wed Jun 06, 2007 7:37 am |
Re: A Go algorithm for chess programmers to try ? |
Dan Andersson |
Wed Jun 06, 2007 7:58 am |
Re: A Go algorithm for chess programmers to try ? |
Alessandro Scotti |
Tue Jun 05, 2007 5:54 pm |
Re: A Go algorithm for chess programmers to try ? |
Gerd Isenberg |
Wed Jun 06, 2007 1:50 pm |
Re: A Go algorithm for chess programmers to try ? |
Rémi Coulom |
Wed Jun 06, 2007 2:40 pm |
Re: A Go algorithm for chess programmers to try ? |
Gerd Isenberg |
Wed Jun 06, 2007 6:05 pm |
Re: A Go algorithm for chess programmers to try ? |
Rémi Coulom |
Wed Jun 06, 2007 6:21 pm |
|
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum
|
|