Author: Uri Blass
Date: 16:05:39 01/02/02
Go up one level in this thread
On January 02, 2002 at 18:54:35, Martin Giepmans wrote: >On January 02, 2002 at 18:29:56, Roy Eassa wrote: > >>How long does it take your program/engine to find White's winning move (and to >>achieve a score that shows the program understands that White is winning)? >> >>[D] r4b1k/pp3Ppp/n1p5/2q1B3/2r5/6RP/PP2Q1P1/5R1K w - - 0 1 > >SpiderChess (amd 1200) >05 00:00:00 - 3.43 G3-B3 C4-C1 B3xB7 A6-B4 B7-F7 C1xF1 F7xF1 B4xA2 > 00:00:00 + 0.36 F1xF8 C5xF8 E2xC4 A8-E8 E5xG7 F8xG7 G3xG7 E8-E1 H1-H2 > H8xG7 >05 00:00:00 + 0.36 F1xF8 C5xF8 E2xC4 A8-E8 E5xG7 F8xG7 G3xG7 E8-E1 H1-H2 > H8xG7 >06 00:00:00 + 0.36 F1xF8 C5xF8 E2xC4 A8-E8 E5xG7 F8xG7 G3xG7 E8-E1 H1-H2 > H8xG7 >07 00:00:00 + 1.11 F1xF8 C5xF8 E2xC4 F8-E7 E5xG7 E7xG7 G3xG7 H8xG7 C4-D4 > G7-G6 G2-G4 >07 00:00:00 + 1.11 F1xF8 C5xF8 E2xC4 F8-E7 E5xG7 E7xG7 G3xG7 H8xG7 C4-D4 > G7-G6 G2-G4 >08 00:00:03 + 1.09 F1xF8 C5xF8 E2xC4 A8-E8 E5xG7 F8xG7 G3xG7 H8xG7 C4-D4 > G7-G6 D4xA7 E8-E1 H1-H2 >09 00:00:12 + 1.30 F1xF8 C5xF8 E2xC4 A8-E8 E5xG7 F8xG7 G3xG7 H8xG7 C4-D4 > G7-G6 D4xA7 E8-E1 H1-H2 E1-E7 >10 00:00:32 + 1.62 F1xF8 C5xF8 E2xC4 A8-E8 E5xG7 F8xG7 G3xG7 H8xG7 C4-D4 > G7-G6 D4xA7 E8-E1 H1-H2 A6-B4 A7xB7 B4xA2 B7xC6 G6-G5 > >Or is there an even better move? > >Martin What is the game that spiderchess analyzes? It cannot be chess because f1xf8 is an illegal move in chess when there is a pawn at f7. 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.