Rush Hour (puzzle) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Rush Hour (puzzle)" in English language version.

refsWebsite
Global rank English rank
1st place
1st place
low place
low place
2nd place
2nd place
407th place
241st place
69th place
59th place
207th place
136th place
low place
low place

arxiv.org

  • John Tromp; Rudy Cilibrasi (2005). "Limits of Rush Hour Logic Complexity". arXiv:cs/0502068.

bizjournals.com

  • Jones, Jennifer (July 30, 1999). "Company toys with Web". Washington Business Journal. Archived from the original on May 5, 2003. Retrieved October 6, 2023.

doi.org

  • 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. CiteSeerX 10.1.1.91.3487. doi:10.1007/978-3-540-75538-8_20. ISBN 978-3-540-75537-1.{{cite book}}: CS1 maint: location missing publisher (link)

michaelfogleman.com

psu.edu

citeseerx.ist.psu.edu

thinkfun.com

web.archive.org

  • Jones, Jennifer (July 30, 1999). "Company toys with Web". Washington Business Journal. Archived from the original on May 5, 2003. Retrieved October 6, 2023.
  • "Official Rush Hour Page Archive". 2011-07-09. Archived from the original on 2011-07-09. Retrieved 2019-09-24.