Author: Dann Corbit
Date: 15:22:37 08/17/00
Go up one level in this thread
On August 17, 2000 at 18:08:36, Vincent Diepeveen wrote: >On August 16, 2000 at 18:41:59, Lars Sandin wrote: > >>On August 16, 2000 at 17:48:20, Dann Corbit wrote: >> >>>On August 16, 2000 at 17:35:44, Jari Huikari wrote: >>> >>>>On August 16, 2000 at 17:23:33, Dann Corbit wrote: >>>> >>>>>Took 2 seconds to solve the hardest two. The other took one second. The >>>>>machine was not a very fast one. On one of the fast machines, it would probably >>>>>do a lot better. >>>> >>>>Was the program searching especially for mates? >>> >>>Chest 3.19 by Heiner Marxen (the best mate solver on the planet by a landslide). >>> >>>>How much time would need >>>>to find the moves, if these positions were in normal game? >>> >>>Infinite. It does not play chess, since it's just a mate solver. On the other >>>hand, on a multithreading machine, you could have the mate solver buzzing away >>>in its own little thread while your chess engine is playing chess in a normal >>>fashion. Then, if the mate solver sees something interesting, it could report >>>it to the chess engine. It is actually an idea I have been entertaining, and >>>incredibly simple to implement. >> >>How fast (approx.) does the program see longer mate-sequences; for instance in a >>normal game - a mate in about 10 moves? > >Oh well it's a mate only searcher. Let's give it a huge mate >(which a selective searcher could find real quick btw) > >8/Bk3p1p/1P3p2/KP2n2p/1P1p4/1Pp2p2/B1P5/7B w - - > >If it finds a mate here, please post the line, >as i don't have the winning line for this position. I know how to win >it, but DIEP will not soon see a mate here, stack problem... >...but i like to keep my mating probs complete. That's not a mate in 10. It is more than 20 ply to any mate from that position.
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.