Computer Chess Club Archives


Search

Terms

Messages

Subject: Two mate positions to solve.

Author: leonid

Date: 14:08:20 09/02/00


Hello!

Please solve these two positions and say minimum number of moves that lead to
it.

 1r2k2r/1b3pbp/1NPqN1n1/1P1Q4/1P2P3/P3B3/5PP1/R3KB1R White to go.

 6KQ/3B2Q1/QQQQQQQ1/5Nbn/qqqqq1q1/5qqk/8/8 White to go.

It will be good if you will indicate all main parameters of your trial. At
least, I see them this way:

Name of your program. Hash table size.
In what way (if you know) position was solved. Selective search or brute force
search.
Time for each way of search.
CPU and its speed.

If you could come with some of your "crazy" (fantasy) position or normal one, it
will be good. When you will depose your, try to make them between 5 and 9 moves
mate. That deep you still can expect reasonable time to be solved by brute force
on our computers.

Thanks in advance,
Leonid.



This page took 0.04 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

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