Author: Vincent Diepeveen
Date: 14:27:59 12/27/00
Go up one level in this thread
On December 27, 2000 at 13:28:31, Gian-Carlo Pascutto wrote: >On December 27, 2000 at 12:32:45, Vincent Diepeveen wrote: > >>First of all SJENG is a mate prover so let's forget sjeng. > >Either you are confusing me with CHEST, or you have bad memory. Sjeng: prove You typed in PROVE and it then shows: "position is won, without showing any 'mate in xx' or whatever. So if i confused you with a mate prover, i'm sorry for that! >>Diep isn't a mate prover but a normal chessprogram. >So is Sjeng. It has, however, a special matefinding search. >It is always enabled for suicide chess, but I also use it for >normal chess or crazyhouse sometimes. >>It took indeed some 6 years of search experiments to get that far. >It took me 2 evenings to implement it. Most of the theoretical >work had been done by Dutch (ironic isn't it?) researchers but >no-one had bothered to implement it for normal chess yet. >>Note that this position was at the homepage from WEINERS company >>to promote if i'm right shredder2. >> >>Nowadays to my amazement shredder4 no longer finds it! >> >>dunno about shredder5. >> >>So if i were as ignorant as the majority of >>posters here: shredder got worse! > >They no longer overextend forced checking sequences. You still do. This is the biggest nonsense i ever heart. You tell me, having made a program which uses less nodes a ply as any other program that's not forward pruning other as nullmove, that i'm 'overextending'? Perhaps you should rephrase that! >Oh and by-the-way...Sjeng without the matefinder finds the correct >move in +-170 nodes. This is complete bullshit unless you have a lot of luck with move ordering which is one in a million or something here, or you count nodes in a very weird way. >-- >GCP
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.