Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Move ordering (and other ways to improve a program)

Author: Vincent Diepeveen

Date: 06:56:45 06/22/99

Go up one level in this thread


On June 20, 1999 at 20:35:21, Michel Chassey wrote:

>Je pourrais suggérer l'adresse suivante :
>http://www.icdchess.com/ccc/resource/links/programming.html
>qui contient beaucoup d'informations utiles. (:
>J'ai pris la liberté de vous répondre en Français, me fiant à votre nom.
>Michel Chassey
>
>On June 20, 1999 at 17:59:01, Nicolas GUIBERT wrote:
>
>>I am currently working on a promising draughts (=international 10x10 checkers)

10x10 draughts, polish rules?

>>program. It finished 2nd in the world championship of the field !

That was behind Flits in Paris recently?

My draughts programs name: Napoleon
programming: Vincent Diepeveen
knowledge and book: Marcel Monteba

>>At this time, I am looking for articles about about move ordering.

it's indeed tough in draughts!

I usual search like 2-4 ply deeper in the middlegame/opening
than any opponent, and in the endgame i search like 20 ply deeper...

Draughts is an ideal testground to measure how well one knows things
from algorithms, also what's happening in draughts might be a
cool way of seeing how things might get for chess, as after like a
night of searching in middlegame/opening Napoleon gets up to 30
full width search depth!

>>Since it seems quite difficult to find some on the net, I thought that maybe
>>someone here could help me to find what I am desperately seeking.
>>
>>Of course, I will be happy to discuss with anyone interested in draughts
>>programs !
>>
>>Bye all,



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.