Author: Uri Blass
Date: 12:38:36 09/08/01
Go up one level in this thread
On September 08, 2001 at 15:30:09, Gian-Carlo Pascutto wrote: >>This position was discussed a long time ago in CCC >>The conclusion of me and Amir Ban and a lot of other people was that black does >>not win a piece because no human could prove that it wins a piece. >> >>If you want to find an impressive move of Deep thought then you need >>to find something that humans can understand. >> >>If humans cannot understand that it is winning a piece after going forward and >>backward with their program then the argument is not convincing. > >I have read the discussions and knew this was going to come up. > >The problem is obvious: > >he asks: show me a position where DB finds a move no other comp can find > >I give you one. No you only gave evaluation that no program could find and it is not exactly what I asked. I asked for a *good* move from deeper blue games that no program can find and you have to convince me that the move is good. One way to convince me is if programs can find the move after a lot of hours and in this case I am going to believe that the move is probably good. 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.