Computer Chess Club Archives


Search

Terms

Messages

Subject: KRR vs KRP tablebases?

Author: guy haworth

Date: 17:42:01 02/17/01

Go up one level in this thread



Eugene Nalimov has done KRR-Kxy where xy = QR, RR, RB or RN ... so all the
sub-endgames are in place for an attack.

Peter Karrer showed how to do P-endgames in manageable slices ... so that
P-endgames take less space (in this way) than P-less endgames.  Peter evolved
Eugene's code.

I don't know whether Eugene has Peter's final code and could work on this.

Guy



This page took 0.22 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.