Author: leonid
Date: 09:38:20 06/10/01
Go up one level in this thread
On June 10, 2001 at 01:02:37, Angrim wrote: >On June 08, 2001 at 18:21:53, leonid wrote: > >>Hi! >> >>If you want to solve this position, it will be easy only if your program is good >>in mates. >> >>[D]1r1qkq1r/Q2nqn1Q/NQ2b1QN/qqQ1bQqq/BQ4QB/q6q/3RQR2/4K3 w - - >> >>Please indicate your result. > >result: I gave up. I let my pn^2 searcher run for 380meg nodes, >and no mate found. There must be a really huge number of possible >lines where white is giving repeated check here. > >Much harder than the two from yesterday(for pn search) :) Very interesting what you are saying. Never mind that this position your solver consider as too long to search. Sometime it is the same for me. What I see is that you write your solver probably like I did. I started with creation of selective search that mainly looked lines that start with checking moves. Later other selective search and brute force variation was added. I am sure that it is only a time before your not checking variation of mate solver will become more efficent. Cheers, Leonid. >>Cheers, >>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.