A counterexample to Henry E. Dudeney’s star puzzle
We found a solution of Henry E. Dudeney’s star puzzle (a path on a chessboard from c5 to d4 in 14 straight strokes) in 14 queen moves, which was claimed impossible by the puzzle author. Generalizing this result to other board sizes, we obtained bounds on minimal number of moves in a board filling queen path with given source and destination.
H.E. Dudeney, 536 puzzles and curious problems, Charles Scribner’s Sons, New York, 1967. jnsilva.ludicum.org/HMR13_14/536.pdf
H.E. Dudeney, The Canterbury puzzles and other Curious problems, Dover Publications, Inc., New York, 1958 (in Russian, M.: Mir, 1986).
M.S. Klamkin, Solutions, The American Mathematical Monthly, 62 (1955), No6, 443.
D.E. Knuth, Dudeney’s puzzles and perplexities in The Strand Magazine, 2001. www-cs-faculty.stanford.edu/~uno/dudeney-strand.txt
C. Rivera, Puzzle 664. The queen covering the chessboard, primepuzzles.net/puzzles/puzz_664.htm
Copyright (c) 2021 A. V. Ravsky
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Matematychni Studii is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) license.