The rook graph $G$ is a graph whose edges represent all the possible legal moves of the rook chess piece on a chessboard. The problem we consider is the following. Given any set $M$ containing pairs of cells such that each cell of the $m1 imes m2$ chessboard is in exactly one pair, we determine the values of the positive integers m1 and m2 for which it is possible to construct a closed tour of all the cells of the chessboard, that is a Hamiltonian cycle, which uses all the pairs of cells in $M$ and possible moves of the rook.
Saved by the rook
Marien Abreu;
2020-01-01
Abstract
The rook graph $G$ is a graph whose edges represent all the possible legal moves of the rook chess piece on a chessboard. The problem we consider is the following. Given any set $M$ containing pairs of cells such that each cell of the $m1 imes m2$ chessboard is in exactly one pair, we determine the values of the positive integers m1 and m2 for which it is possible to construct a closed tour of all the cells of the chessboard, that is a Hamiltonian cycle, which uses all the pairs of cells in $M$ and possible moves of the rook.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.