Author: Uri Blass
Date: 05:40:19 08/30/03
Go up one level in this thread
On August 30, 2003 at 08:18:41, Geoff wrote: >Hi > >My program just "excelled" itself with my favourite worst ever move. >This shambles wasn't due to an obvious bug as such, more just to lack of search >depth. Here is the position > >[D]2r3k1/1b2n1bp/p2N4/1p6/6Q1/1P6/1PqN1PPP/R5K1 b - - 0 30 > >My program was playing black, my opponent offered me 2 tempting hung pieces >adjacent to my queen. My program avoided the knight capture, but couldn't resist >gobbling up the white pawn on b2. >Can you see the outcome of this move just be looking at the position? I couldnt >really see it, but most computer analysis will show it very quickly. >Hint: I got smothered, very elegantly !! Yes This idea is a known idea for chess player and I guess that even most players with rating 1600 will have no problem to see it. > >The other reason I found this quite amusing was the opponent that trapped me >into this blunder. Was it Shredder?, Junior?, Fritz? , nope just humble old TSCP >:-) > >Anyone else got a favorite clanger that wasn't due to just an obvious bug ? > > Regards Geoff I can only tell you that if my program does not find something simple like that in less than 0.1 second then it is a clear proof that it has bugs or problems that I need to fix. Uri
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.