Author: Vincent Diepeveen
Date: 16:27:33 08/10/00
Go up one level in this thread
On August 10, 2000 at 19:08:18, Colin Frayn wrote: >On August 10, 2000 at 16:17:47, Christoph Fieberg wrote: > >>Unbelievable, but true: >>I composed a position which is mate in 1 and can easily found, but Fritz6 on >>Pentium III, 500 Mhz and 32 MB Hash needs more than 1 hour to show it (excatly >>1:03:17)!!! >>How do other computers react? >> >>The position is >>FEN: 8/8/pppppppK/NBBR1NRp/nbbrqnrP/PPPPPPPk/8/Q7 w - - 0 1 > >You're seriously telling me that top quality programs have to think about a mate >in 1? Now either there's something wrong with the setup, or a bug in the >program, or simply that's just bad programming. I don't see how a simple >iterative deepening loop could ever miss a mate in one, regardless of null moves >or extensions or otherwise. oh you can easily search forever in this position if you sort in the wrong way and do a lot of captures in the qsearch. Just start in the h8 corner generating, then 7th rank etc till you get to a1. First captures of course. Then get directly into qsearch, there you can search quite a long time. You still didn't do a null, extension or whatever then. Just a qsearch. >ColChess finds this mate in a total of 42 nodes, none of which it searches for >more than a preliminary ordering evaluation. This all takes significantly under >a milisecond. Have I missed some subtlety here? > >Cheers, >Col
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.