Sign In

Login

Password

Forgot Password ? Sign Up

15 puzzle (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "15 puzzle" in English language version.

refsWebsite
Global rank English rank
4web.archive.org
1st place
1st place
4cubezzz.duckdns.org
low place
low place
2doi.org
2nd place
2nd place
2aaai.org
9,352nd place
5,696th place
2neverendingbooks.org
low place
low place
1iastate.edu
2,548th place
1,587th place
1acm.org
1,185th place
840th place
1umontreal.ca
6,223rd place
6,135th place
1cubezzz.dyndns.org
low place
low place
1cornellmath.wordpress.com
low place
low place
1etsu.edu
low place
low place
1youtube.com
9th place
13th place

aaai.org

  • Korf, R. E. (2000), "Recent Progress in the Design and Analysis of Admissible Heuristic Functions" (PDF), in Choueiry, B. Y.; Walsh, T. (eds.), Abstraction, Reformulation, and Approximation (PDF), SARA 2000. Lecture Notes in Computer Science, vol. 1864, Springer, Berlin, Heidelberg, pp. 45–55, doi:10.1007/3-540-44914-0_3, ISBN 978-3-540-67839-7, archived from the original (PDF) on 2010-08-16, retrieved 2010-04-26
  • Ratner, Daniel; Warmuth, Manfred (1986). "Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable" (PDF). National Conference on Artificial Intelligence. Archived (PDF) from the original on 2012-03-09.

acm.org

dl.acm.org

  • Richard E. Korf, Linear-time disk-based implicit graph search, Journal of the ACM Volume 55 Issue 6 (December 2008), Article 26, pp. 29-30. "For the 4 × 4 Fifteen Puzzle, there are 17 different states at a depth of 80 moves from an initial state with the blank in the corner, while for the 2 × 8 Fifteen Puzzle there is a unique state at the maximum state of 140 moves from the initial state."

cornellmath.wordpress.com

cubezzz.duckdns.org

cubezzz.dyndns.org

doi.org

  • Korf, R. E. (2000), "Recent Progress in the Design and Analysis of Admissible Heuristic Functions" (PDF), in Choueiry, B. Y.; Walsh, T. (eds.), Abstraction, Reformulation, and Approximation (PDF), SARA 2000. Lecture Notes in Computer Science, vol. 1864, Springer, Berlin, Heidelberg, pp. 45–55, doi:10.1007/3-540-44914-0_3, ISBN 978-3-540-67839-7, archived from the original (PDF) on 2010-08-16, retrieved 2010-04-26
  • Ratner, Daniel; Warmuth, Manfred (1990). "The (n2−1)-puzzle and related relocation problems". Journal of Symbolic Computation. 10 (2): 111–137. doi:10.1016/S0747-7171(08)80001-6.

etsu.edu

faculty.etsu.edu

iastate.edu

cs.iastate.edu

  • Korf, R. E. (2000), "Recent Progress in the Design and Analysis of Admissible Heuristic Functions" (PDF), in Choueiry, B. Y.; Walsh, T. (eds.), Abstraction, Reformulation, and Approximation (PDF), SARA 2000. Lecture Notes in Computer Science, vol. 1864, Springer, Berlin, Heidelberg, pp. 45–55, doi:10.1007/3-540-44914-0_3, ISBN 978-3-540-67839-7, archived from the original (PDF) on 2010-08-16, retrieved 2010-04-26

neverendingbooks.org

umontreal.ca

iro.umontreal.ca

  • A. Brüngger, A. Marzetta, K. Fukuda and J. Nievergelt, The parallel search bench ZRAM and its applications, Annals of Operations Research 90 (1999), pp. 45–63.
    :"Gasser found 9 positions, requiring 80 moves...We have now proved that the hardest 15-puzzle positions require, in fact, 80 moves. We have also discovered two previously unknown positions, requiring exactly 80 moves to be solved."

web.archive.org

  • Korf, R. E. (2000), "Recent Progress in the Design and Analysis of Admissible Heuristic Functions" (PDF), in Choueiry, B. Y.; Walsh, T. (eds.), Abstraction, Reformulation, and Approximation (PDF), SARA 2000. Lecture Notes in Computer Science, vol. 1864, Springer, Berlin, Heidelberg, pp. 45–55, doi:10.1007/3-540-44914-0_3, ISBN 978-3-540-67839-7, archived from the original (PDF) on 2010-08-16, retrieved 2010-04-26
  • Ratner, Daniel; Warmuth, Manfred (1986). "Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable" (PDF). National Conference on Artificial Intelligence. Archived (PDF) from the original on 2012-03-09.
  • "m × n puzzle (current state of the art)". Sliding Tile Puzzle Corner.
  • Beeler, Robert. "The Fifteen Puzzle: A Motivating Example for the Alternating Group" (PDF). faculty.etsu.edu/. East Tennessee State University. Archived from the original (PDF) on 7 January 2021. Retrieved 26 December 2020.

youtube.com