Author: guy haworth
Date: 04:45:22 04/03/00
Go up one level in this thread
Troitzky proved that KNNNNKQ was sometimes a win for White (see Tim Krabbe's excellent "Chess Curiosities", p. 179, line -8). The computation of an EGT for KNNNNKQ is some 2.5x bigger as a problem than the equivalent for KabKcd (no Pawns) which is 8x harder than KQQKQQ, the first 6-man EGT to be computed recently. Ken Thompson has computed several KabKcd tables (qb-rb, qb-rn, qn-rb, qr-qb, qr-qn, qr-rb, rb-bn, rb-nn, rn-bn) so maybe KNNNKQ is not so far away! Troitzky's notional chess set included 4 White Knights (as above) and 5 White Bishops! Any other obtrusive force? Guy Haworth
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.