Jean-Christophe Weill
- 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. Google ScholarDigital Library
- 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. Google ScholarCross Ref
- 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.Google ScholarCross Ref
- 11.KUSZMACL, B. Synchronized MIMD Computing. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, May 1994. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 19.PEARL, J. Asymptotic properties of minimax trees and game-searching procedures. Artificial Intelligence 14 (1980), 113-138.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
Index Terms
The ABDADA distributed minimax search algorithm
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 GamesThe 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 intelligenceIn 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