Covering a chessboard with staircase walks

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