Author: leonid
Date: 18:14:19 03/05/00
Go up one level in this thread
On March 05, 2000 at 16:03:20, Heiner Marxen wrote: >On March 05, 2000 at 15:36:05, leonid wrote: > >>On March 05, 2000 at 11:36:32, Heiner Marxen wrote: >> >>>On March 05, 2000 at 10:13:11, leonid wrote: >>> >>>>On March 04, 2000 at 18:16:54, José de Jesús García Ruvalcaba wrote: >>>> >>>>>On March 03, 2000 at 23:49:40, pavel wrote: >>>>> >>>>>>i was wondering if i need any additional hardware or software to save files in >>>>>>CDs or to save files from cds to harddisk? if its hardware what should? and if >>>>>>its foftware, can you pls name a good software? i am running pentium II 450mhz >>>>>>compaq presario. >>>>>>thanks for the help ;) >>>>>> >>>>>>ps, comet doesnt find a checkmate (quite easy) that almost all program find in >>>>>>less then 40 sec (junior 23sec). if anyone interested i can send the game, since >>>>>>i dont know how to post a diagram in this forum ;) >>>>> >>>>> Just paste a fen string, and add a 'D' between brackets at the left. For >>>>>example: >>>>> >>>>>[D]6k1/6p1/8/4K1P1/8/7P/8/8 w - - 0 1 >>>> >>>>Tried the position for mate 9 moves deep, white to go. No mate was found. Beyond >>>>this depth finding inevitable mate could be very often quit time expensive. If >>>>somebody will go farther, would like to know how many moves there are before the >>>>mate and how time it took. Please mention your game and your hardware. >>> >>>Chest 3.19 (PIII/550 500MB hash) needs 731 seconds to show that there is >>>no mate in 16. Note that chest 3.19 does not access any endgame tables. >>> >>>There is some direct EG table access on the net. I tried >>>http://chess.liveonthenet.com/chess/endings/ >>>and it says: mate in 26 by Kf4. >>>Since that site states to use the Thompson's CDs (which are shortest >>>conversion if recall correctly), I'm not sure whether this is shortest mate. >>> >>>Also, this was just an example position by José de Jesús García Ruvalcaba, >>>and most probably not the one, the original poster (pavel) wanted to >>>talk about. >>> >>>Heiner >>> >>>>Thanks, >>>>Leonid. >> >>Hiener you impressed me! My logic took around 1 minute to say no for 9 moves (18 >>plies). It is also true that mine goes only after strict and use no memory >>expensive tools, like hash tables. Anyway mine is not slow for sure. I found >>this by trying the mate containing positions by thousand against the best games >>in the town 4 years ago. At that time, when position contained mate, mine was >>simply the speedest one after the extentive statics. > >Thanks! Use of hash memory can be disabled in chest. Computing the above >for depth 9 needs then less than 6 seconds (PIII/550 again). :-) >Well, I have a special move counting logic for the case that white has >just pawns left. This does quite well, here, cutting a lot of subtrees. > >>All the best Heiner in your programming! I hope that you will publish somehow >>you logic. Would like to see your logic expended to the complet chess game as >>well. > >Well, it _is_ published. You can get the sources (ANSI-C) from my web page >http://www.drb.insel.de/~heiner/Chess/chest.html >It was never intended to be anything else but a mate solver, so I doubt >it is a good start for a playing program. Feel free to try it, though :-) > >If by publishing you mean that I write a paper explaining it verbosely, >sorry, I have no plans to do so. Some of the ideas are explained in >some memo files coming with the source, some are explained in comments >in the code, but some ideas are not explained there at all. Sorry. > >>See you next time, >>Leonid. > >Have a nice day! >Heiner My words about "publication" were badly chosen. I wanted to say if you will end somewhere by comercial edition of your game. It is good that you have source open to the public but I doubt that I will ever read it. I had as intention already during the last three years to read finally general theory of the chess game but never did. Only few short reading here and there on the Net and some responses found on the spot from the people that knows chess theory. It is so difficult to find some free time in our life! It is interesting that you find response for 9 moves in just few seconds. Usually when you have inside of each ply somewhere around 20 nodes, and there promotion of the pawn probably permit this, time for 13 moves should take probably more that few months to be solved. Only "quick logic", and this position never sound to be solvable by it, can take up to the 13 moves in just a split of the second. I speak about 13 moves since it is limit in my mate solving logic. See you! Leonid.
This page took 0.01 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.