• DocumentCode
    273237
  • Title

    Chess on a hypercube

  • Author

    Otto, Steve W. ; Felten, Edward W.

  • Author_Institution
    California Inst. of Technol., Pasadena, CA, USA
  • fYear
    1988
  • fDate
    11-15 Apr 1988
  • Firstpage
    30
  • Lastpage
    42
  • Abstract
    The authors have developed a parallel chess program to run on distributed memory, multiple instruction stream computers. The program follows the strategy of currently successful sequential chess programs: searching of an alpha-beta pruned game tree, iterative deepening, transposition and history tables, specialized endgame evaluators, and so on. The search tree is decomposed onto a hypercube (an NCUBE) using a recursive version of the principal-variation-splitting algorithm. Roughly speaking, subtrees are searched by teams of processors in a self-scheduled manner
  • Keywords
    computer games; games of skill; parallel programming; MIMD; alpha-beta pruned game tree; chess program; distributed memory; endgame evaluators; hypercube; multiple instruction stream computers; parallel processing;
  • fLanguage
    English
  • Publisher
    iet
  • Conference_Titel
    Design and Application of Parallel Digital Processors, 1988., International Specialist Seminar on the
  • Conference_Location
    Lisbon
  • Print_ISBN
    0-85296-366-1
  • Type

    conf

  • Filename
    10357
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=273237