On 10th March 2006, Marc Bourzutschky announced that Yakov Konoval's program had computed the DTC/Z endgame table (EGT) for KQBNKQB and found: maxDTZ/C = 330 moves: maxDTZ position = 1k6/1b5q/N7/8/8/1Q6/8/B1K5+b DTC = Depth to Conversion, i.e., change of force and/or mate DTZ = Depth to (move-count) Zeroing (move), i.e. P-push and/or Conversion This depth leaves all chess records of this kind well behind: 193m = the longest decisive game in classical chess: Stepak-Mashian (1980) 199m = longest (rapid) decisive chess game: Petrosian-Milanovic (2005) 262m = the greatest known EGT maxDTM(ate), in KRNKNN 269m = longest (drawn) chess game: Nikolic-Arsovic (1989), 290m = the deepest known Chess Problem - by O.T.Blathy 290m = the previous maxDTC/Z record - in KRRNKRR Generation and verification of the EGT required 3.5 weeks of a 3.6GHz processor. The first two attempts to generate this EGT were frustrated by interrupted power supplies. guy