Author: leonid
Date: 21:58:30 05/15/01
Go up one level in this thread
On May 15, 2001 at 22:43:45, Dann Corbit wrote: >On May 15, 2001 at 22:09:28, leonid wrote: > >>On May 15, 2001 at 21:30:59, Heiner Marxen wrote: >> >>>On May 15, 2001 at 16:57:46, leonid wrote: >>> >>>>On May 15, 2001 at 16:38:22, Dann Corbit wrote: >>>> >>>>>On May 15, 2001 at 06:30:34, leonid wrote: >>>>> >>>>>>Hi! >>>>>> >>>>>>If you would like to solve one simple mate then you have one. >>>>>>[D]1qbBBbq1/1Q5r/R2Nq1P1/2Q1N1n1/KQ2q1rk/2Q1N1n1/R2Nq1P1/1Q5r w - - >>> >>>>If this position should be solved by brute force, and not by selective, then >>>>position is slow for me as well. To give you right idea, will say my numbers. >>>>Celeron 600Mhz. Mate solver with no hash. Selective, 9 moves - 2 seconds. Brute >>>>force, 9 moves - 1 hour 23 min. This position is mate in 9 moves. >>> >>>Wow, this time I'm impressed by _your_ time. Chest (K7, 600MHz, 350MB hash) >>>needs 6595.53 sec (109.9 min) (1.8 hrs) for the mate 9. It finds 2 key moves: >> >>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 like a simple interface with a lot of options. Anyway, you could easily >interface Chest to Chess Assistant and have the most glorious GUI interface >imagineable. Indeed, the EPD processor type engines can bolt right in to Chess >Assistant. Chest is a very good example of a chess analyzer that eats EPD and >spits out EPD. > >I share your respect for Heiner's coding. He's also a real nice guy. Probably I see even more reason to be in admiration of its program that you can see. This first by looking into the fact that Heiner code is C based. So, even if its program have close branching factor with mine, when its hash is disconnected, mine it big looser. My is written completely on Assembler. From positive side it signify that I am missing to see somewhere probable three or four folds possible speeding. Speed of reference - brute force search, 10 plys deep. You are used to connect interfaces often and for you it is simple. It is not so for everybody. For me even all those abreviations (that you should read before connection and that float so freely on this site) give me slight dizzeness, like seeing movie about extraterrestrials, or feeling marijuana smoke on my street. I think that Heiner program must take in consideration ordinary people like me (sure majority on this Planet) and to have interface connected to its program since the start. At least, your explanation give me impression that it is already done for "chosen" few. I hope it will be soon so for the rest of us. >>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.
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.