Open AccessA counterexample to Henry E. Dudeney’s star puzzle
Author(s) -
Alex Ravsky
Publication year - 2021
Publication title -
matematičnì studìï/matematičnì studìï
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.482
H-Index - 8
eISSN - 2411-0620
pISSN - 1027-4634
DOI - 10.30970/ms.56.2.215-217
Subject(s) - counterexample , queen (butterfly) , star (game theory) , path (computing) , combinatorics , mathematics , mathematical economics , computer science , mathematical analysis , programming language , hymenoptera , botany , biology
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.