Author: Bruce Moreland
Date: 10:32:46 12/28/01
Go up one level in this thread
On December 28, 2001 at 08:51:30, Mike Hood wrote: >On December 27, 2001 at 22:30:26, Dann Corbit wrote: > >>On December 27, 2001 at 22:25:20, Gogi Cviak wrote: >> >>>Guys, if u know a programmer, let me know, somebody who knows chess and >>>checkers, this is strictly for fun, no sales! >> >>There are dozens of programmers who post here. >> >>>can 3 knights beat a rook, >> >>Yes. And no. Depends on the position. >> >>>can 2 knights and a bishop win against a rook, >> >>Yes. And no. Depends on the position. >> >>>what do the databases say? >> >>Try a lookup and see. There is an online version of the Nalimov tables that you >>can query to your heart's content. > >I'm not aware that there's a KBNN-KR tablebase available, or in fact any 6 piece >tablebases for Kxxx-Kx. I would be more interested in KBNN-KQ, if anyone has a >computer powerful enough to generate it. > >A general question is... are there any 6-piece tablebases available anywhere >apart from Bob Hyatt's server? KBNN vs KQ has to be drawn: 1) The queen isn't going to beat the pieces, since there are lots of pieces. 2) The pieces aren't going to beat the queen, since QxB is a draw. KBNN vs KR is interesting to think about. 1) RxB is drawn, but ... 2) ... RB vs R is almost won, and that's one "point" less. Of course, RxB is *not* draw in that case. If it is won, I bet it is *extremely* difficult. I'd bet on drawn. KNNN vs KR can't possibly be a win for the knights, since RxN is drawn, and there are three of them to threaten. In KBN vs KRR, "all" you have to do to win is win an exchange with a knight while preserving your bishop, but in this one you have to win a whole rook while preserving everything. Interesting questions. bruce
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.