Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: One mate to solve...

Author: leonid

Date: 20:14:03 05/15/01

Go up one level in this thread



>To be sincere, Heiner, I even more impressed by your solver. It is only a pitty
>that it is hidden of its clumsy shell. Without any doubt the best mate solver
>ever! I hope that some programmer will come with graphics and very soon. This
>will make it instantly accessible and popular with everybody. The most difficult
>and laborious part of mate solver is already accomplished. And we have here so
>many people that are very prolific in C and graphics! I hope somebody is
>listening...
>
>I indicate first mate in 9 moves. Revision for 8 moves took already 1 hour and
>19 min. Complete revision for 9 moves can be expected, after branching factor,
>in around 11 hours.
>
>Cheers,
>Leonid.


Heiner, I want only add few words. I think that in order to facilitate initial
graphic edition, program could be simplified. Less variables, much easier to
express its mind through its new facial expression. Program can start only with
usual mate search. No selfmates and so like. For those who need "extras", your
actual program will be all the time available. But once first graphic edition
started, in coming editions all other features could be included.

Leonid.
Leonid.



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.