Author: leonid
Date: 15:01:07 10/18/01
Go up one level in this thread
On October 17, 2001 at 11:50:44, Heiner Marxen wrote: >On October 17, 2001 at 09:10:15, leonid wrote: > >>On October 16, 2001 at 19:13:11, Heiner Marxen wrote: >> >>>On October 16, 2001 at 11:50:15, leonid wrote: >>> >>>>On October 16, 2001 at 10:12:33, Paul wrote: >>>> >>>>>On October 16, 2001 at 07:26:29, leonid wrote: >>>>> >>>>>>Hello! >>>>>> >>>>>>This mate position was not exactly easy for my selective but was still >>>>>>accessible for brute force solution. Try to solve it on your own way. >>>>>> >>>>>>[D]2KRQRnr/2Q4q/2N1nq1k/2Q2q1q/b1Ppqb1r/q6N/pqBRQQQB/8 w - - >>>>>> >>>>>>Please indicate your result. >>>>>> >>>>>>Thanks, >>>>>>Leonid. >>>>> >>>>>Hi guy, >>>> >>>>Hi, Paul! >>>> >>>>>I hope you don't mean that your selective search solved this one in 3 seconds in >>>>>stead of .055 :) ... but Pretz didn't have too much trouble finding a mate in 11 >>>>>in 11 seconds: >>>> >>>>Now you did better that me for sure. Mine took by selective, 11 moves deep, in >>>>79 sec. >>>> >>>>This is position 11 moves deep. Solved it by brute force. It took 1 hour and 19 >>>>min. Celeron 600Mhz. No hash. >>>> >>>>>00:11 WM11 08 Q2xh5+ Rxh5 Qxh7+ Rxh7 Rxf6+ Nxf6 Qeg6+ Qxg6 Bxf4+ Kg7 Qa7+ Qb7+ >>>>>Qxb7+ Nc7 Qxc7+ Nd7 Qxd7+ Qae7 Qxe7+ Qxe7 Qxg6# >>> >>>Hello mate fans, >> >>Hi! >> >>>Chest finds two solutions for the mate in 11: >>> >>>PV: Q2xh5+ Rxh5 Rxf6+ Nxf6 Qxh7+ Rxh7 Qgg6+ Qxg6 Bxf4+ Ng5 Qef8+ Rg7 Qxg5+ Qxg5 >>>Qxf6+ Kh7 Nxg5+ Rhxg5 Bxe4+ R7g6 Rh8# >>>PV: Qxh7+ Rxh7 Q2xh5+ Rxh5 Rxf6+ Nxf6 Qgg6+ Qxg6 Bxf4+ Ng5 Qef8+ Rg7 Qxg5+ Qxg5 >>>Qxf6+ Kh7 Nxg5+ Rhxg5 Bxe4+ R7g6 Rh8# >>> >>>On my K7/600 with 350 MB hash that took 21 minutes. Timing: >>> >>># 1 0.00s 0kN 0.87 1- 0 >>># 2 0.00s 0kN 1.00 1- 0 >>># 3 0.02s 1kN [ 9.73] 0.94 91- 0 >>># 4 0.08s [ 4.00] 7kN [ 7.25] 1.05 368- 0 >>># 5 0.41s [ 5.12] 31kN [ 4.66] 1.26 1791- 0 >>># 6 1.72s [ 4.20] 127kN [ 4.06] 1.61 8201- 0 >>># 7 6.37s [ 3.70] 478kN [ 3.77] 2.18 30602- 0 >>># 8 25.52s [ 4.01] 1892kN [ 3.96] 3.13 130520- 0 >>># 9 98.62s [ 3.86] 7190kN [ 3.80] 4.50 542991- 0 >>># 10 357.13s [ 3.62] 25000kN [ 3.48] 6.29 2091028- 78 >>># 11 1259.30s [ 3.53] 82123kN [ 3.28] 7.86 7728629- 483006 >> >>Time is excellent! > >Thanks. Without hash your time is also very excellent, about equal! > > >> But did ever some other program came here in somehow close >>result in brute force? I don't remember anyone. Maybe I am missing something. > >No. I myself have not seen such a program. Also, up to now I have not >heard about such a biest. One program I do not know about its quality >and speed is Alybadix, a commercial problem solver (I saw it at gambitsoft). >May be it is very good, dunno. > >Another "contender" can be Popeye. It is open software like Chest, >and can do all the fairy pieces and stipulations. Like Chest, it is >a console application (sorry). I do not know whether it interfaces to some >GUI, last time I checked it did not. > >Another problem solver, Gustav, takes another approach to achieve speed: >the user is asked for meaningful selectivity conditions. That way it >can do something similar to your "selective search". >Gustav is also commercial (e.g. gambitsoft). It has its own GUI (IIRC). > >Then there is Problemiste. IIRC it can handle fairy stuff. >I do not know more about it. > >If you do some Google searches with the above "keywords", you may find >more info. I have done so some years ago, but I tend to forget about >programs which only run under Windows, since I can/will not use them. > > >Herzliche und herbstliche Grüße aus Berlin, >Heiner Hi, Heiner! Yesterday I tried to find some mate solver by Net but was not capable. Or I went to some places that no more contain indicated solver, or something not worked there. Will come back today to the link that I found yesterday and will try once again. Sometime, some very good program could stay unknown for some special reason. Actually, you program was very few times indicated here compared with Chess Master. Reason - it demand special access. Explanation that Paul brought few weeks ago, how to use your program, helped in this sense but not removed obstacle. I hope that some kind of practical indication (way the Paul done it) will be included in your description permanently. Cheers from Montreal, 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.