Computer Chess Club Archives


Search

Terms

Messages

Subject: Has anyone kept a record of reported "Techniques" used in DeepBlue?

Author: Joshua Lee

Date: 10:02:34 11/13/01


I have seen many argue this point weather or not DB had much in the way of
intellegence which makes no sense do you really think that IBM would risk just
having a node cruncher?  Don't you think that Someone on the DB team would
explain how there are many positions where brute force wouldn't work even if
every cpu in the world were connected together?

What technigues Can be used together and on micros? Has anyone tried to make
their program more like this enigma?

Here's what i found:

sophisticated quiescence search
  - endgame heuristics
  - a few small endgame databases
  - position repetition detection
  - calculates mobility
  - evaluates space
  - close to 50 tables to evaluate a chess move
      (implied that this includes:
          piece square tables
          pawn bitmaps
          open file
          coefficient updates after each move (incremental evaluation)

Deep Blue can recognize (in hardware) approximately 6,000
chess-specific features



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.