Pentago is a First Player Win: Strongly Solving a Game Using Parallel In-Core Retrograde Analysis

C. E. Shannon, “XXII.Programming a computer for playing chess,” Philosophical magazine , vol. 41, no. 314, pp. 256–275, 1950

1950

Earlier work this paper cites.

S. Reisch, “Gobang ist PSPACE-vollständig,” Acta Informatica , vol. 13, no. 1, pp. 59–66, 1980

1980

Earlier work this paper cites.

L. V. Allis, A knowledge-based approach of connect-four . Vrije Universiteit, Subfaculteit Wiskunde en Informatica, 1988

1988

Earlier work this paper cites.

L. V. Allis, H. J. Herik, and M. Huntjens, Go-moku and threat-space search . Univ. of Limburg, Department of Computer Science, 1993

1993

Earlier work this paper cites.

J. Tromp. (1995) John’s connect four playground. [Online]. http://homepages.cwi.nl/~tromp/c4/c4.html

1995

Earlier work this paper cites.

P. Deutsch and J.-L. Gailly, “Zlib compressed data format specification version 3.3,” 1996

1996

Earlier work this paper cites.

P. J. Mucci, S. Browne, C. Deane, and G. Ho, “PAPI: A portable interface to hardware performance counters,” in Proc. of the Department of Defense HPCMP Users Group Conference , 1999, pp. 7–10

1999

Earlier work this paper cites.

J. Wágner and I. Virág, “Solving renju.” ICGA Journal , vol. 24, no. 1, pp. 30–35, 2001

2001

Earlier work this paper cites.

H. J. Van den Herik, J. W. Uiterwijk, and J. Van Rijswijck, “Games solved: Now and in the future,” Artificial Intelligence , vol. 134, no. 1, pp. 277–311, 2002

2002

Earlier work this paper cites.

K. Schloegel, G. Karypis, and V. Kumar, “Parallel static and dynamic multi-constraint graph partitioning,” Concurrency and Computation: Practice and Experience , vol. 14, no. 3, pp. 219–240, 2002

2002

Earlier work this paper cites.

J. Black and P. Rogaway, “Ciphers with arbitrary finite domains,” in Topics in Cryptology – CT-RSA 2002 . Springer, 2002, pp. 114–130

2002

Cited alongside, same era.

S. S. Shende and A. D. Malony, “The TAU parallel performance system,” International Journal of High Performance Computing Applications , vol. 20, no. 2, pp. 287–311, 2006

2006

Cited alongside, same era.

J. Schaeffer, N. Burch, Y. Björnsson, A. Kishimoto, M. Müller, R. Lake, P. Lu, and S. Sutphen, “Checkers is solved,” Science , vol. 317, no. 5844, pp. 1518–1522, 2007

2007

Cited alongside, same era.

R. Kern. (2007, Dec.) A simple file format for Numpy arrays. [Online]. https://github.com/numpy/numpy/blob/master/doc/neps/npy-format.txt

2007

Cited alongside, same era.

J. K. Salmon, M. A. Moraes, R. O. Dror, and D. E. Shaw, “Parallel random numbers: as easy as 1, 2, 3,” in High Performance Computing, Networking, Storage and Analysis (SC), 2011 International Conference for . IEEE, 2011, pp. 1–12

2011

Later among the works it cites.

T. Ewalds, “Playing and solving havannah,” Ph.D. dissertation, University of Alberta, 2012

2012

Later among the works it cites.

V. Makhnychev and V. Zakharov. (2012, Jul.) Lomonosov endgame tablebases. [Online]. http://chessok.com/?page_id=27966

2012

Later among the works it cites.

MPI Forum, “MPI: A message-passing interface standard. Version 3.0.” Nov. 2012

2012

Later among the works it cites.

J. Squyres. (2012) MPI progress. [Online]. http://blogs.cisco.com/performance/mpi-progress

2012

Later among the works it cites.