Gary Flake and Eric Baum (2002). "Rush Hour is PSPACE-complete, or why you should generously tip parking lot attendants". Theoretical Computer Science. 270 (1–2): 895–911. doi:10.1016/S0304-3975(01)00173-6.
Collette, Sébastien; Raskin, Jean-françois; Servais, Frédéric (May 2006). "On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game". Computers and Games. Lecture Notes in Computer Science. Vol. 4630. Turin, Italy. pp. 220–233. CiteSeerX10.1.1.91.3487. doi:10.1007/978-3-540-75538-8_20. ISBN978-3-540-75537-1.{{cite book}}: CS1 maint: location missing publisher (link)
michaelfogleman.com
Michael Fogleman (July 2018). "Solving Rush Hour, the Puzzle". How I created a database of all interesting Rush Hour configurations.
psu.edu
citeseerx.ist.psu.edu
Collette, Sébastien; Raskin, Jean-françois; Servais, Frédéric (May 2006). "On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game". Computers and Games. Lecture Notes in Computer Science. Vol. 4630. Turin, Italy. pp. 220–233. CiteSeerX10.1.1.91.3487. doi:10.1007/978-3-540-75538-8_20. ISBN978-3-540-75537-1.{{cite book}}: CS1 maint: location missing publisher (link)