Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A match in DRAUGHTS , Too many DRAWS !!!

Author: Tony Werten

Date: 05:17:10 02/08/01

Go up one level in this thread


On February 08, 2001 at 08:02:44, Uri Blass wrote:

>On February 08, 2001 at 06:30:14, Tony Werten wrote:
>
>>On February 08, 2001 at 04:24:11, David Blackman wrote:
>>
>>>On February 07, 2001 at 16:41:28, Tanya Deborah wrote:
>>>
>>>>
>>>>
>>>>Hi!
>>>>
>>>>I am playing a new match in checkers between the 2 strongest Spanish checkers
>>>>programs of the world...
>>>
>>>Just curious, is "Spanish checkers" the same game as "Polish Draughts",
>>>"International Draughts", "Damen" etc?
>>
>>She could have meant 2 spanish programs playing polish checkers :)
>>
>>I think it's true for the other coutries as well, but the game played in Holland
>>is international draughts.
>>>
>>>http://www.multimania.com/nic55/dames/dames2.htm
>>>
>>>They say it is played in
>>>"most French-speaking countries (France, Belgium, Switzerland, Canada, and the
>>>African continent) and also in the Netherlands, and in the ex-soviet union
>>>countries."
>>
>>If I remember correctly, in the SU they let the children start with checkers to
>>get some ideas about the tactics, before switching to draughts.
>>
>>>
>>>This is the game on the 10x10 board.
>>>
>>>According to people who have tried, it is a bit harder to write a strong program
>>>for it than for chess. Perhaps it should be the next big board-game programming
>>>challenge, now that chess programs are more or less in reach of the top human
>>>players, and Go still seems much too hard.
>>
>>Depends on what you call difficult. In checkers ( and draught ) there seems to
>>be no additional strength from searching deeper anymore, only from better
>>evaluation. Which is a bit harder to achieve.
>
>What is the data that you are based on.
>
>Is there a ssdf list for draught programs when the same program was tested on
>different hardwares?

I've got it from some papers about diminishing returns for additional search.
The conclusion  was that a 19ply searching program is hardly stronger than a
17ply.

Tony

>
>Uri



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.