Author: Daniel Clausen
Date: 13:42:16 05/02/00
Go up one level in this thread
Hi On May 02, 2000 at 07:38:08, Ed Schröder wrote: >On May 02, 2000 at 06:26:34, Michael Neish wrote: > >>In the position below White wins material by the blindingly obvious Bg5. >> >>[D]6k1/pp1nrppp/5rb1/P2P4/5BP1/5P2/4BK1P/R3R3 b - - >Rebel gives a bonus of 1.00 in eval for Bg5 assuming one of those rooks >get lost. A higher bonus is quite risky as the opponent often has an >escape. The effect in search is minor. It was effective in the days of >programs running at 5 Mhz hiting 5-6 plies only. Nowadays I would not >spend time on such (processor) time consuming cases. Still sounds like an interesting idea to me. Maybe it can be used for move-ordering. Depending how easy it is for a specific engine to detect such cases it might help a lil, but then, only experiments can answer this. (It's on my ever-growing todo-list :) Kind regards, -sargon
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.