Browsing by Subject "Rook's path"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    ItemOpen Access
    Covering a rectangular chessboard with staircase walks
    (Elsevier, 2015) Kerimov, A.
    Let C(n, m) be a n×m chessboard. An ascending (respectively descending) staircase walk on C(n, m) is a rook’s path on C(n, m) that in every step goes either right or up (respectively right or down). We determine the minimal number of ascending and descending staircase walks covering C(n, m).