Taha Rostami

Queen domination by SAT solving

The queen domination problem asks for the minimum number of queens required to attack all squares on an nxn chessboard. Once this optimal number is known, determining the number of distinct solutions up to isomorphism has also attracted considerable attention. Previous work has i...