Article

Free access

The ABDADA distributed minimax search algorithm

Author:

Jean-Christophe WeillAuthors Info & Claims

CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer science

Pages 131 - 138

https://doi.org/10.1145/228329.228345

Published: 20 February 1996 Publication History

PDF eReader

References

[1]

BARRIUSO, R., AND KNIES, A. SHMEM User's Guide Revision 1.08. CRAY Research Inc, April 1994.

Google Scholar

[2]

BACDOT, M.-F., WEILL, J.-C., SERET, J.-L., AND GONDRAN, M. Frenchess: A Cray T3D at the 8th World Computer Chess Championship. In 1st European Cray- T3D Workshop (Sept. 1995), ~cole Polytechnique F~d~rale, de Lausanne and CRAY Research.

Google Scholar

[3]

BEHLINER, H., AND EBELING, C. Pattern knowledge and search: The SUPREM architecture. Artificial Intelligence 38, 2 (Mar. 1989), 161-198.

Digital Library

Google Scholar

[4]

HRATNO, I., AND KOPEC, D. A test for comparison of human and computer performance. In Advances in Computer Chess III (1982), M. Clarke, Ed., Pergamon Press, pp. 31 56.

Google Scholar

[5]

BROCKINGTON, M. An implementation of the young brothers wait concept. Internal report, University of Alberta, 1994.

Google Scholar

[6]

DAVID, V. Algorithmique parall~le sur les arbres de d~cision et raisonnement en temps contraint. ~tude et application au Minimax. PhD thesis, ENSAE, Nov. 1993.

Google Scholar

[7]

FELDMANN, R. Spielbaumsuchc mit massiv parallelen Systemen. PhD thesis, Fachbereich Mathematik / Informatik Universit~t GH Paderborn, 1993.

Google Scholar

[8]

FELDMANN, R., MONIEN, B., MYSLIWIETZ, P., AND VORNBERGER., O. Distributed game tree search, In Parallel Algorithms for Machine Intelligence and Vision (1990), V. Kumar, K.L.N., and P. Popalkrishman, Eds., Springer Verlag, pp. 66 101.

Crossref

Google Scholar

[9]

FELDMANN, R., MYSLIWIETZ, P., AND VORNBERGER, O. A local area network used as as parallel architecture. Tech. Rep. 31, University of Paderborn, Sept. 1986.

Google Scholar

[10]

HYATT, M., SUTER, B., AND NELSON, H. A parallel alpha/beta searching algorithm. Parallel Computing 10, 3 (1989), 299-308.

Crossref

Google Scholar

[11]

KUSZMACL, B. Synchronized MIMD Computing. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1994.

Digital Library

Google Scholar

[12]

KUSZMAUL, B. The StarTech massively-parallel chess program. ICCA Journal 18, 1 (Mar. 1995), 3 19.

Google Scholar

[13]

MARSLAND, T., A review of game-tree pruning. ICCA Journal 9, 1 (1986), 3-19.

Google Scholar

[14]

MARSLAND, T., AND CAMPBELL, M. Parallel search of strongly ordered game trees. Computing Surveys 14, 4 (1982), 553-562.

Digital Library

Google Scholar

[15]

MARSLAND, T., OLAFSSON, M., AND SCHAEFFER, J. Multiprocessor tree-search experiments. In Advances in Computer Chess IV (1986), D. Beal, Ed., Pergamon Press, pp. 37-51.

Crossref

Google Scholar

[16]

MARSLAND, T., AND POPOWICH, F. Parallel game tree search. IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 4 (1985), 442-452.

Google Scholar

[17]

NEWBORN, M. Unsynchronized iteratively deepening parallel alpha-beta search. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-10, 5 (Sept. 1988), 687-694.

Digital Library

Google Scholar

[18]

OTTO, S., AND FELTEN, E. Chess on a hypercube. In The Third Conference on Hypercube Concurrent Computers and Applications (1988), vol. 2, pp. 1329-1341.

Digital Library

Google Scholar

[19]

PEARL, J. Asymptotic properties of minimax trees and game-searching procedures. Artificial Intelligence 14 (1980), 113-138.

Crossref

Google Scholar

[20]

REINEFELD, A. An improvement to the scout treesearch algorithm. ICCA Journal 6, 4 (1983), 4-14.

Google Scholar

[21]

SCHAEFFER, J. Distributed game-tree search. Journal of Parallal and Distributed Computing 6, 2 (1989), 90- 114.

Digital Library

Google Scholar

[22]

THINKING MACHINES CORPORATION. CMMD Reference Manual V3.0. Cambridge, Massachusetts, May 1993.

Google Scholar

[23]

WEILL, J.-C. Programmes d'~checs de championnot : architechture logicielle, synth~se de functions d'~valuation, parall~lisme de recherche. PhD thesis, Universit~ de Paris VIII, Saint-Denis (France), Jan. 1995.

Google Scholar

[24]

WIRTH, N. Algorithms and Data Structures. Prentice- Hill International Editions, 1986.

Digital Library

Google Scholar

Cited By

View all

Silla CPaglioney MMardegany I(2016)jOthelloT: A java-based open source Othello framework for artificial intelligence undergraduate classes2016 IEEE Frontiers in Education Conference (FIE)10.1109/FIE.2016.7757577(1-7)Online publication date: Oct-2016
https://doi.org/10.1109/FIE.2016.7757577
Silla CPrzybysz ALeal W(2016)Music education meets computer science and engineering education2016 IEEE Frontiers in Education Conference (FIE)10.1109/FIE.2016.7757413(1-7)Online publication date: Oct-2016
https://doi.org/10.1109/FIE.2016.7757413
Li LLiu HWang HLiu TLi W(2015)A Parallel Algorithm for Game Tree Search Using GPGPUIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2014.234505426:8(2114-2127)Online publication date: 1-Aug-2015
https://doi.org/10.1109/TPDS.2014.2345054
Show More Cited By

Index Terms

The ABDADA distributed minimax search algorithm
1. Computing methodologies
  1. Artificial intelligence
    1. Control methods
    2. Search methodologies
2. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques
      1. Dynamic programming
    2. Data structures design and analysis
      1. Sorting and searching

Recommendations

The *-minimax search procedure for trees containing chance nodes

An extention of the alpha-beta tree pruning strategy to game trees with 'probability' nodes, whose values are defined as the (possibly weighted) average of their successors' values, is developed. These '*-minimax' trees pertain to games involving chance ...
Rediscovering *-MINIMAX search
CG'04: Proceedings of the 4th international conference on Computers and Games

The games research community has devoted little effort to investigating search techniques for stochastic domains. The predominant method used in these domains is based on statistical sampling. When full search is required, Expectimax is often the ...
The fringe-saving A* search algorithm: a feasibility study
IJCAI'07: Proceedings of the 20th international joint conference on Artifical intelligence

In this paper, we develop Fringe-Saving A* (FSA*), an incremental version of A* that repeatedly finds shortest paths in a known gridworld from a given start cell to a given goal cell while the traversability costs of cells increase or decrease. The ...

Comments

Information & Contributors

Information

Published In

CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer science

February 1996

162 pages

ISBN:0897918282

DOI:10.1145/228329

Chairmen:
Robert E. Beck
Villanova Univ., Villanova, PA
,
Mary Lou Soffa
Univ. of Pittsburgh, Pittsburgh, PA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 February 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CSC96

Sponsor:

CSC96: 24th Annual ACM Computer Science Conference

February 15 - 18, 1996

Pennsylvania, Philadelphia, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
767
Total Downloads

Downloads (Last 12 months)85
Downloads (Last 6 weeks)13

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Silla CPaglioney MMardegany I(2016)jOthelloT: A java-based open source Othello framework for artificial intelligence undergraduate classes2016 IEEE Frontiers in Education Conference (FIE)10.1109/FIE.2016.7757577(1-7)Online publication date: Oct-2016
https://doi.org/10.1109/FIE.2016.7757577
Silla CPrzybysz ALeal W(2016)Music education meets computer science and engineering education2016 IEEE Frontiers in Education Conference (FIE)10.1109/FIE.2016.7757413(1-7)Online publication date: Oct-2016
https://doi.org/10.1109/FIE.2016.7757413
Li LLiu HWang HLiu TLi W(2015)A Parallel Algorithm for Game Tree Search Using GPGPUIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2014.234505426:8(2114-2127)Online publication date: 1-Aug-2015
https://doi.org/10.1109/TPDS.2014.2345054
Li LLiu HLiu PLiu TLi WWang H(2012)A Node-based Parallel Game Tree Algorithm Using GPUsProceedings of the 2012 IEEE International Conference on Cluster Computing10.1109/CLUSTER.2012.45(18-26)Online publication date: 24-Sep-2012
https://dl.acm.org/doi/10.1109/CLUSTER.2012.45
Valentine D(2005)Playing around in the CS curriculumJournal of Computing Sciences in Colleges10.5555/1059888.105994820:5(214-222)Online publication date: 1-May-2005
https://dl.acm.org/doi/10.5555/1059888.1059948

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

The *-minimax search procedure for trees containing chance nodes

Rediscovering *-MINIMAX search

The fringe-saving A* search algorithm: a feasibility study