3 papers
math.CO2025
Hyper-bishops, Hyper-rooks, and Hyper-queens: Percentage of Safe Squares on Higher Dimensional Chess Boards
Caroline Cashman, Joseph Cooper, Raul Marquez +2
The queens problem considers the maximum number of safe squares on an chess board when placing queens; the answer is only known for small . Miller, Sheng an…
cs.CC2025
Misère Partizan Arc Kayles is PSPACE-complete, even on Planar Graphs
Kyle Burke, Caroline Cashman, Alfie Davies +2
We show that Misère Partizan Arc Kayles is PSPACE-complete on planar graphs via a reduction from Bounded Two-Player Constraint Logic. Furthermore, we show how to embed our gadgets…
math.NT2025
Black Hole Zeckendorf Games
Caroline Cashman, Steven J. Miller, Jenna Shuffleton +1
Zeckendorf proved that every positive integer can be written as a decomposition of non-adjacent Fibonacci numbers. Baird-Smith, Epstein, Flint, and Miller converted the process of…