Author: Russell Reagan
Date: 12:07:38 10/16/03
Go up one level in this thread
Here's some more fuel for the fire. I emailed this guy. I said: "A good implementation of an array based move generator will be quite a bit faster than a good implementation of a bitboard program, assuming 32-bit hardware. Maybe even on 64-bit hardware." He replied: "Hello Russell, I do not think you are correct. A bitboard operation executes so much faster. This is why virtually all chess programs are bitboard based, and I know of none that use an array move generator. For example, I tested the following position on Zillions and on Vortex that has just 3 pieces. White Archbishop on a1 White King on a8 Black King on j1 White to move. After 3 full days (72 hours) Zillions still shows a very high score. After 1:17 minutes, the Vortex program announces a mate in 23 (which is 46 plies) on my 2.8 GHz Pentium 4, and it eventually SOLVES the entire ending in 6:56 improving it to a mate in 17. The program reported searching 550,459 positions/second. Zillions does not even come close to this. --Ed" He sounds kind of like the Anti-Vincent, "A bitboard operation executes so much faster." Virtually all chess programs are bitboard based? HE KNOWS OF NONE THAT ARE ARRAY BASED??? Can anyone here top 550 Knps?
This page took 0.01 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.