Article ID Journal Published Year Pages File Type
4647383 Discrete Mathematics 2013 5 Pages PDF
Abstract

An ascending (resp., descending) staircase walk   on a chessboard is a rook’s path that goes either right or up (resp., down) in each step. We show that the minimum number of staircase walks that together visit every square of an n×nn×n chessboard is ⌈23n⌉.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,