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×n chessboard is ⌉2/3⌉.
Bibliographical noteFunding Information:
The second author was supported by a BSF grant (grant No. 2008290 ) and by an ISF grant (grant No. 1357/12 ).
- Lattice path
- Staircase walk
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics