DOCSLIB.ORG

The Anatomy of Chess Programs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Anatomy of Chess Programs From: AAAI Technical Report WS-97-04. Compilation copyright © 1997, AAAI (www.aaai.org). All rights reserved. The Anatomy of Chess Programs T.A. Marsland ComputingScience Department University of Alberta Edmonton, AB Canada T6G 2H1 Tony.Marsland@ ualberta.ca Abstract other highly constrained tactical issues. All programsuse This short paperdefines the terminologyused to support the same underlying depth-first alpha-beta search computerchess work,and introduces the basic concpets algorithm. What varies from program to program is the behindchess programs.It is intendedto be of general length (or "depth", to keep the layer analogy) of search interest, providingbackground information not newideas. assigned to each of these stages. Ultimately the stage length is not fixed, but varies by small amountsdepending on the current sequence of moves being examined. For Introduction example, a search path maybe locally lengthened because one side has attacked the King (given check), leaving the Logically, chess is a trivial game: at every move, simply opponent with only a few alternatives to consider. There follow through each possible reply and its consequences are so manyoptions here that even programs using the until either a mate or a draw position is reached. In same basic model can achieve a radically different style practical terms, however, this strategy is not workable, and speed of play. since an astronomically large numberof chess positions would have to be examined. Thus both humanplayers and computersrely on simplification to build an approximate Tree Searching model of the game. Humanplayers have centuries of While the humanmethod of analyzing alternatives seems tradition and at least two hundredyears of chess literature to involve selecting a few promising lines of play and to draw on in building their personal model, but computer exploring them, computers are necessarily exhaustive chess is less than fifty years old. Significant amongthe rather than selective, so refinement techniques have been early ideas in computerchess is Claude Shannon’s1.949-50 developed. In a technique called "iterative deepening," distinction between a brute force (type-A) strategy for instead of embarkingon a single search of a certain ply looking at every combination of moves, and the use of (which might not be completed in the given time) the chess knowledgeto select and examineonly a subset of the computerpertbrms a series of increasingly deeper searches available moves(type-B strategy). Althoughsome electro- (N-ply, then N+I, then N+2, etc.) until the allotted time mechanical systems to play a subset of chess had been runs out. Thus it is able to producethe best movethat the built prior to Shannon’swork, it was the programmingof time constraint allows--a computer-chesssituation that has his ideas that led to the developmentof today’s computer manyparallels in real-time applications. The computercan chess machines. combine iterative deepening with various memory Current chess programs view the gameas a tree search in which each position corresponds to a node in the game- functions, particularly refutation and transposition tables, tree, and each moveis a branch (a transition from one node to reorder moves,so that at the next iteration its selected to the next). Thus the tree is madeup of alternating layers "principal variation" (best sequence of movesfound during or levels of movesfor each side. (The term "ply" is used the previous iteration) is explored first. Another move- to denote each layer, and refers to one move by one reordering technique is to keep a short list of "killer" player.) A three-stage tree model is popular with computer moves, which are tried first. Killer movesare those that chess programmers. The first stage uses a brute force have successfully "cut oft’’ or pruned the search elsewhere. (Shannontype-A) approach, the second a selective (type- Often these killer movesare captures, so a simplification B) search, and the third a strategy knownas a quiescence involves considering capture movesbefore all others. This search, designed to resolve the problemsand conflicts that technique is nicely generalized in the "history heuristic remain. In this final stage the program evaluates table" that many programs use. In its most elementary sequences of capturing moves, assesses pawn promotion potentials, examines checking sequences and considers form a history table has 64x64 entries, each containing a 24 Value game positions each side might have close to 80 moves. With today’s technology, programs exhaustively search 7 Brute Force to 10 ply in the middle game, while at least one Full-width programmerclaims to extend searches selectively to 40 Layers ply! Selective extensions are based on heuristics devised by individual programmers to explore the sphere of influence associated with a key move: to examine the movesthat might defend against a mate threat, or that might provide a counter attack and thus indirectly avoid some imminent loss. Selective extensions are not to be confusedwith singular extensions. The latter technique re- examines any movethat looks singularly good relative to the others. The search depth is increased to determine Selective whether the singular move remains best. In some sense Layers this is a way of extending the principal variation in the small. It is a potentially costly but interesting method. More popular and more widely used is the null move heuristic, where one side provisionally makes two successive moves. If the value of the position remains poor even with the benefit of two movesin a row, then the line of play is abandoned. This is one way to identify situations where an inevitable loss is otherwise being pushed out of sight beyond the search horizon. While Quiescent manyforward pruning methods fail too often to be useful, Layers null moveforward pruning is usually beneficial. Transposition Table A transposition table serves as a cache memoryand is used to store information about positions that have been visited Value before, usually during an earlier part of an iterative deepeningsearch. It is so called because it can be used to value that measures the frequency with which the recognize transpositions in the order of moves. Stored in corresponding possible move has recently pruned the the entry associated with a position are important items search. like the "value" of the position, the best movefrom there, Move-reordering mechanismsenhance the efficiency of and the length of the previous search. "Value" is computed the depth-first alpha-beta search algorithm. Three other by applying an evaluation function at the terminal nodes of improvements--Pearl’s Scout algorithm and the related the tree (the nodes on the horizon where the search is NegaScoutand Principal Variation Search (PVS) methods- stopping). This evaluation function often includes -share a commontheme: once a principal variation has quiescent search to help resolve existing capture sequences been found it is sufficient to showthat each alternative is and other uncertainties in the position, such as pending inferior. Anythat is not inferior mustbe re-searched, since pawnpromotions. Transposition tables are also invaluable it nowconstitutes the preferred path. Another technique as a means of extending search in the endgame,where only for curtailing the search is called aspiration alpha-beta a few new movesemerge at each node, the others leading search. In this approach the value of the tree from the through transposition to positions that have been seen current position is estimated and a narrow search window before. These tables do not increase program size or (customarily plus and minus the value of half a pawn complexity, since the total space allocated to them is around that estimate) is used. Aspiration searching is simply a matter of cost. Each transposition-table entry popular and better understood alternative to the Principal requires about 10 bytes of memory, and most programs Variation Search method,although not as efficient. have tables in the range from 32,000 to 1 million entries, It is difficult to be precise about the advantages that though in 1993 one Supercomputer program boasted a moresearching provides. The size of the chess tree for any table with a 1,000 million entries! This wide range simply position is highly variable. In manyendgames there are reflects the memoryavailable to the programmer. only about 8 movesfor each side, while in complexmiddle 25 Program Performance and Rating The Future Despite the underlying similarity in methodsthere is wide These days the top chess machines are challenging the variation in performance amongthe programs, even in Grandmasters, especially in rapid play where the stand- machines using identical hardware. In some cases this alone PC-based machines have an advantage over merely reflects the effort put into the program’s multiprocessor-based systems. Stand-alone machines are development. For example, although every program has especially fast, because they don’t need the services of a an opening book, there is no basic book for them to use. computer network to transmit their moves. Multiprocessor Each team develops its own. At present these books vary machinesusing 10 to 100 processors are often better at the in size fl’om about 10,000 chess positions to about 500,000 standard competition rate of play of 40 movesin 2 hours. positions, although one experimental program has 1.7 Soon systems with 1000 processors, each as powerful as a million book entries. Conversely, only a few people use high-performance PC, will be with us. Even if their Ken Thompson’s CD-ROMdatabase of 5 and 6-piece efficiency is only at the 50%level, they will be able to endgames.This is partly for technical reasons related to search 2 or 3 ply deeper in a typical middle-gameposition relatively slow access to the database, but also because than any single-processor system. By then computers will most games finish before reaching these knownendings. be clearly out-searching humans. Whether this will be Perhaps programmersare just being realistic about howto enough to compensate for the human’s proven strength in spend their time! long-term planning remains to be seen.
Load more

Recommended publications
  • FIDE Laws of Chess
    FIDE Laws of Chess FIDE Laws of Chess cover over-the-board play. The Laws of Chess have two parts: 1. Basic Rules of Play and 2. Competition Rules. The English text is the authentic version of the Laws of Chess (which was adopted at the 84th FIDE Congress at Tallinn (Estonia) coming into force on 1 July 2014. In these Laws the words ‘he’, ‘him’, and ‘his’ shall be considered to include ‘she’ and ‘her’. PREFACE The Laws of Chess cannot cover all possible situations that may arise during a game, nor can they regulate all administrative questions. Where cases are not precisely regulated by an Article of the Laws, it should be possible to reach a correct decision by studying analogous situations which are discussed in the Laws. The Laws assume that arbiters have the necessary competence, sound judgement and absolute objectivity. Too detailed a rule might deprive the arbiter of his freedom of judgement and thus prevent him from finding a solution to a problem dictated by fairness, logic and special factors. FIDE appeals to all chess players and federations to accept this view. A necessary condition for a game to be rated by FIDE is that it shall be played according to the FIDE Laws of Chess. It is recommended that competitive games not rated by FIDE be played according to the FIDE Laws of Chess. Member federations may ask FIDE to give a ruling on matters relating to the Laws of Chess. BASIC RULES OF PLAY Article 1: The nature and objectives of the game of chess 1.1 The game of chess is played between two opponents who move their pieces on a square board called a ‘chessboard’.
    [Show full text]
  • Learning to Play Chess Using Temporal Differences
    Machine Learning, 40, 243–263, 2000 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Learning to Play Chess Using Temporal Differences JONATHAN BAXTER [email protected] Department of Systems Engineering, Australian National University 0200, Australia ANDREW TRIDGELL [email protected] LEX WEAVER [email protected] Department of Computer Science, Australian National University 0200, Australia Editor: Sridhar Mahadevan Abstract. In this paper we present TDLEAF(), a variation on the TD() algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our chess program “KnightCap” used TDLEAF() to learn its evaluation function while playing on Internet chess servers. The main success we report is that KnightCap improved from a 1650 rating to a 2150 rating in just 308 games and 3 days of play. As a reference, a rating of 1650 corresponds to about level B human play (on a scale from E (1000) to A (1800)), while 2150 is human master level. We discuss some of the reasons for this success, principle among them being the use of on-line, rather than self-play. We also investigate whether TDLEAF() can yield better results in the domain of backgammon, where TD() has previously yielded striking success. Keywords: temporal difference learning, neural network, TDLEAF, chess, backgammon 1. Introduction Temporal Difference learning, first introduced by Samuel (Samuel, 1959) and later extended and formalized by Sutton (Sutton, 1988) in his TD() algorithm, is an elegant technique for approximating the expected long term future cost (or cost-to-go) of a stochastic dy- namical system as a function of the current state.
    [Show full text]
  • Hypermodern Game of Chess the Hypermodern Game of Chess
    The Hypermodern Game of Chess The Hypermodern Game of Chess by Savielly Tartakower Foreword by Hans Ree 2015 Russell Enterprises, Inc. Milford, CT USA 1 The Hypermodern Game of Chess The Hypermodern Game of Chess by Savielly Tartakower © Copyright 2015 Jared Becker ISBN: 978-1-941270-30-1 All Rights Reserved No part of this book maybe used, reproduced, stored in a retrieval system or transmitted in any manner or form whatsoever or by any means, electronic, electrostatic, magnetic tape, photocopying, recording or otherwise, without the express written permission from the publisher except in the case of brief quotations embodied in critical articles or reviews. Published by: Russell Enterprises, Inc. PO Box 3131 Milford, CT 06460 USA http://www.russell-enterprises.com [email protected] Translated from the German by Jared Becker Editorial Consultant Hannes Langrock Cover design by Janel Norris Printed in the United States of America 2 The Hypermodern Game of Chess Table of Contents Foreword by Hans Ree 5 From the Translator 7 Introduction 8 The Three Phases of A Game 10 Alekhine’s Defense 11 Part I – Open Games Spanish Torture 28 Spanish 35 José Raúl Capablanca 39 The Accumulation of Small Advantages 41 Emanuel Lasker 43 The Canticle of the Combination 52 Spanish with 5...Nxe4 56 Dr. Siegbert Tarrasch and Géza Maróczy as Hypermodernists 65 What constitutes a mistake? 76 Spanish Exchange Variation 80 Steinitz Defense 82 The Doctrine of Weaknesses 90 Spanish Three and Four Knights’ Game 95 A Victory of Methodology 95 Efim Bogoljubow
    [Show full text]
  • Rules of Chess960
    Rules of Chess960 A little known and long-discarded offshoot of Classical Chess is the realm of so-called "Randomized Chess" in its various forms. Chess960 stands for Bobby Fischer's new and improved version of "Randomized Chess". Chess960 uses algebraic notation exclusively At the start of every game of a Chess960 game, both players Pawns are set up exactly as they are at the start of every game of Classical Chess. In Chess960, just before the start of every game, both players pieces on their respective back rows receive an identical random shuffle using the Chess960 Computerized Shuffler, which is programmed to set up the pieces in any combination, with the provisos that one Rook has to be to the left and one Rook has to be to the right of the King, and one Bishop has to be on a light- colored square and one Bishop has to be on a dark-colored square. White and Black have identical positions. From behind their respective Pawns the opponents pieces are facing each other directly, symmetrically. Thus for example, if the shuffler places White's back row pieces in the following position: Ra1, Bb1, Kc1, Nd1, Be1, Nf1, Rg1, Qh1, it will place Black's back row Pieces in the following position, Ra8, Bb8, Kc8, Nd8, Be8, Nf8, Rg8, Qh8, etc. (See diagram) In Chess960 there are 960 possible starting positions, the Classical Chess starting position and 959 other starting positions. Of necessity, In Chess960 the castling rule is somewhat modified and broadened to allow for the possibility of each player castling either on or into his or her left side or on or into his or her right side of the board from all of these 960 starting positions.
    [Show full text]
  • Grivas Opening Laboratory
    Efstratios Grivas GRIVAS OPENING LABORATORY VOLUME 1 Chess Evolution Cover designer Piotr Pielach Typesetting i-Press ‹www.i-press.pl› First edition 2019 by Chess Evolution Grivas opening laboratory. Volume 1 Copyright © 2019 Chess Evolution All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, electrostatic, magnetic tape, photocopying, recording or otherwise, without prior permission of the publisher. ISBN 978-615-5793-19-6 All sales or enquiries should be directed to Chess Evolution 2040 Budaors, Nyar utca 16, Magyarorszag e-mail: [email protected] website: www.chess-evolution.com Printed in Hungary TABLE OF CONTENTS Key to symbols ...............................................................................................................5 Foreword .........................................................................................................................7 Preface ............................................................................................................................11 PART 1. THE GRUENFELD DEFENCE (D91) Chapter 1. Black’s 5th-move Deviat — Various Lines ........................................... 17 Chapter 2. Black’s 5th-move Deviat — 5...dxc4 ......................................................27 Chapter 3. Black’s 7th-move Deviat — 7...dxc4 ......................................................43 Chapter 4. Black’s 11th-move Deviat ........................................................................73
    [Show full text]
  • Lost in Translation Or Full Steam Ahead Michael Kaeding
    Lost in Translation or Full Steam Ahead Michael Kaeding To cite this version: Michael Kaeding. Lost in Translation or Full Steam Ahead. European Union Politics, SAGE Publi- cations, 2008, 9 (1), pp.115-143. 10.1177/1465116507085959. hal-00571759 HAL Id: hal-00571759 https://hal.archives-ouvertes.fr/hal-00571759 Submitted on 1 Mar 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. European Union Politics Lost in Translation or Full DOI: 10.1177/1465116507085959 Volume 9 (1): 115–143 Steam Ahead Copyright© 2008 SAGE Publications The Transposition of EU Transport Los Angeles, London, New Delhi Directives across Member States and Singapore Michael Kaeding European Institute of Public Administration (EIPA), The Netherlands ABSTRACT This study supplements extant literature on implementation in the European Union (EU). The quantitative analysis, which covers the EU transport acquis, reveals five main findings. First, the EU has a transposition deficit in this area, with almost 70% of all national legal instruments causing problems. Second, transposition delay is multifaceted. The results provide strong support for the assertion that dis- tinguishing between the outcomes of the transposition process (on time, short delay or long delay) is a useful method of investigation.
    [Show full text]
  • A Status Report on Losing Chess
    1 A status report on Losing Chess Mark Watkins University of Sydney, School of Mathematics and Statistics [email protected] It’s unfortunate that so much knowledge seems to have gone missing. – Gian-Carlo Pascutto 1. INTRODUCTION The purpose of this writing is to report on the current status of Losing Chess. Since the naming of this class of games has variant schools of terminology, we state for definiteness that captures are compulsory (but the choice of the player on turn when there are multiple captures), that the King has no special characteristics, and that castling is not legal. Promotion to a King is allowed. This is also sometimes called Antichess. In particular, we give information about responses to 1. e3. Some of this dates back more than a decade, and is due to others. However, other parts described herein have a few novel features. Unless otherwise stated, we use the International Rules, so that a stalemate is a win for the player on move.1 1.1 Historical sources There exist a number of piecemeal Internet sites that have various information about Losing Chess. However, many of the pages of interest have not been touched in 5-10 years. Most of them use FICS rules, for which stalemate is a win for the player with fewer pieces (and drawn when the piece counts are equal). See also the ICGA page [H]. 1.1.1 Pages of Fabrice Liardet Fabrice Liardet is one of best (human) Losing Chess players in the world. His French language site [Li] has a wealth of information about the game.
    [Show full text]
  • The PENNSWOODPUSHER September 2008 a Quarterly Publication of the Pennsylvania State Chess Federation
    The PENNSWOODPUSHER September 2008 A Quarterly Publication of the Pennsylvania State Chess Federation Push Us and We’ll Topalover Of course 16...Bxf6 would lose, but it would have been the only way by Bruce W. Leverett of attempting a liberation. 17.c3 That was the name of our team in the US Amateur Team East last White’s only defensive move in the game. There’s not much to be February. Jeff Quirke and Bryan Norman organized the team, and afraid of, but there’s also plenty of time to prepare a timely transfer of then recruited me, and I then recruited Federico Garcia. Our team the Queen to the kingside without allowing the Black Knight to d4. average rating was 2191, close to the legal limit of 2199.75. The name 17...d4 was chosen, according to Jeff, because “I like ridiculous puns”. This is actually good: White has to be prevented from replacing the e- The USATE is like the Pittsburgh Chess League, but about 6 or 7 pawn by a bishop, which would (and will) be deadly. times as large - 291 teams, 1251 players - and all jammed in to one 18.Qxh5 Qd6?! 19.Nf5 Bxf5 20.exf5 e4 long weekend. It was held at the Parsippany Hilton, in New Jersey. And e4 is free for the Bishop. We all climbed into Bryan’s minivan and rode there on Friday after- 21.Bxe4! Qg3+ noon and evening, and returned late Monday night. There is no follow up to this enthusiastic check, and the Queen on the g-file is actually good for White.
    [Show full text]
  • 4 the Fianchetto Variation
    Contents Symbols 4 Bibliography 5 Introduction 6 1 The Reversed Sicilian: Introduction 7 2 The Reversed Dragon (Main Lines) 29 3 The Closed Variation 43 4 The Fianchetto Variation (King’s Indian Approach by Black) 58 5 The Three Knights 76 6 The Four Knights without 4 g3 92 7 The Four Knights with 4 g3 134 8 Systems with ...f5 167 9 Systems with 2...d6 or 2...Íb4 207 10 Early Deviations 237 Index of Variations 254 THE FIANCHETTO VARIATION 4 The Fianchetto Variation (King’s Indian Approach by Black) The lines covered in this chapter are become problematic if White is able to hugely popular among players who get his b-pawn rolling, as the contact employ the King’s Indian with the with Black’s pawns is instantaneous. black pieces. Black often hopes that White will ‘cooperate’ by playing d4 -+-+-+-+ and thereby enter the Fianchetto King’s +pz-+p+p Indian. If this is not to White’s taste, he can continue along the lines given -+-z-+p+ below. +P+-z-+- The lines are at times quite compli- -+P+-+-+ cated, but with careful study from ei- +-+P+-Z- ther side, both White and Black can play for the full point. -+-+PZ-Z +-+-+-+- Typical Pawn Structures -+-+-+-+ Here, we have already had an initial +p+-+p+p confrontation, which resulted in the a-pawns leaving the board. White has -+pz-+p+ a huge space advantage on the queen- z-+-z-+- side, while Black initially does not -+P+-+-+ have much on the kingside, but poten- +-+P+-Z- tially he can gain a similar advantage PZ-+PZ-Z by playing ...h6, ...g5, and ...f4.
    [Show full text]
  • The Fianchetto System
    opening repertoire the Fianchetto System Damian Lemos www.everymanchess.com About the Author is a Grandmaster from Argentina. He is a former Pan-American Damian Lemos Junior Champion and was only 15 years old when he qualified for the International Master title. He became a Grandmaster at 18 years old. An active tournament player, GM Lemos also trains students at OnlineChessLessons.net. Contents About the Author 3 Bibliography 6 Preface 7 1 The Symmetrical English Transposition 9 2 The Grünfeld without ...c6 40 3 The Grünfeld with...c6 52 4 The King’s Indian: ...Ìc6 and Panno Variation 78 5 The King’s Indian: ...d6 and ...c6 103 6 The King’s Indian: ...Ìbd7 and ...e5 122 Index of Variations 169 Index of Complete Games 175 Preface Dealing with dynamic and aggressive defences like the Grünfeld or King’s Indian is not an easy task for White players. Over the years, I’ve tried several variations against both openings, usually choosing lines which White establishes a strong cen- tre although Black had lot of resources as well against those lines. When I was four- teen years old, I analysed Karpov-Polgar, Las Palmas 1994 (see Chapter 4, Game 25) and was impressed with the former World Champion’s play with White. Then, I real- ized the Fianchetto System works well for White for the following reasons: 1) After playing g3 and Íg2, White is able to put pressure on Black’s queenside. What’s more, White’s kingside is fully protected by both pieces and pawns. 2) The Fianchetto System is playable against both King’s Indian and Grünfeld de- fences.
    [Show full text]
  • Glossary of Chess
    Glossary of chess See also: Glossary of chess problems, Index of chess • X articles and Outline of chess • This page explains commonly used terms in chess in al- • Z phabetical order. Some of these have their own pages, • References like fork and pin. For a list of unorthodox chess pieces, see Fairy chess piece; for a list of terms specific to chess problems, see Glossary of chess problems; for a list of chess-related games, see Chess variants. 1 A Contents : absolute pin A pin against the king is called absolute since the pinned piece cannot legally move (as mov- ing it would expose the king to check). Cf. relative • A pin. • B active 1. Describes a piece that controls a number of • C squares, or a piece that has a number of squares available for its next move. • D 2. An “active defense” is a defense employing threat(s) • E or counterattack(s). Antonym: passive. • F • G • H • I • J • K • L • M • N • O • P Envelope used for the adjournment of a match game Efim Geller • Q vs. Bent Larsen, Copenhagen 1966 • R adjournment Suspension of a chess game with the in- • S tention to finish it later. It was once very common in high-level competition, often occurring soon af- • T ter the first time control, but the practice has been • U abandoned due to the advent of computer analysis. See sealed move. • V adjudication Decision by a strong chess player (the ad- • W judicator) on the outcome of an unfinished game. 1 2 2 B This practice is now uncommon in over-the-board are often pawn moves; since pawns cannot move events, but does happen in online chess when one backwards to return to squares they have left, their player refuses to continue after an adjournment.
    [Show full text]
  • A Performance Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 13, NO. 5, MAY 2002 447 A Performance Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search John W. Romein, Henri E. Bal, Member, IEEE Computer Society, Jonathan Schaeffer, and Aske Plaat Abstract—This paper discusses a new work-scheduling algorithm for parallel search of single-agent state spaces, called Transposition-Table-Driven Work Scheduling, that places the transposition table at the heart of the parallel work scheduling. The scheme results in less synchronization overhead, less processor idle time, and less redundant search effort. Measurements on a 128-processor parallel machine show that the scheme achieves close-to-linear speedups; for large problems the speedups are even superlinear due to better memory usage. On the same machine, the algorithm is 1.6 to 12.9 times faster than traditional work-stealing-based schemes. Index Terms—Distributed search, single-agent search, work pushing, Transposition-Table-Driven Work Scheduling (TDS), IDA*. æ 1INTRODUCTION ANY applications heuristically search a state space to many benefits, including preventing the expansion of Msolve a problem. These applications range from logic previously encountered states, move ordering, and tighten- programming to pattern recognition and from theorem ing the search bounds. The transposition table is particu- proving to chess playing. Achieving high performance, both larly useful when a state can have multiple predecessors in terms of solution quality and execution speed, is of great (i.e., when the search space is a graph rather than a tree). importance for many search algorithms, such as real-time The basic tree-based recursive node expansion strategy search and any-time algorithms.
    [Show full text]