2 papers
cs.DM2026
The Optimal Knight Exchange Puzzle is NP-Hard
Henry Siegel
This paper explores the hardness of two popular recreational chess puzzles: The Knight's Tour and the Knight Exchange (Swap). The problem of finding a Knight's Tour is known to be…
math.CO2023
Embedding dimension gaps in sparse codes
R. Amzi Jeffs, Henry Siegel, David Staudinger +1
We study the open and closed embedding dimensions of a convex 3-sparse code , which records the intersection pattern of lines in the Fano plane. We show that the clos…