Queen v Knight

This paper introduces Queen versus Knight, a chessboard puzzle where stationary queens create unsafe squares and a knight must visit every remaining safe square exactly once. It explores friendly and hostile queen arrangements on boards of different sizes, proves two infinite families of solutions, and includes diagrams and independently checkable supporting files.