Covering a chessboard with staircase walks

Eyal Ackerman, Rom Pinchasi

Research output: Contribution to journalArticlepeer-review


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⌉.

Original languageEnglish
Pages (from-to)2547-2551
Number of pages5
JournalDiscrete Mathematics
Issue number22
StatePublished - 2013

Bibliographical note

Funding 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


Dive into the research topics of 'Covering a chessboard with staircase walks'. Together they form a unique fingerprint.

Cite this