can be thought of as repeating that leaper's move in one direction until an obstacle is reached. If the obstacle is a friendly piece, it blocks further movement; if the obstacle is an enemy piece, it may be captured, but it cannot be jumped over. There are three riders in : the rook is a (0,1)-rider; the bishop is a (1,1)-rider; and the queen combines both patterns. Sliders are a special case of riders which can only move between geometrically contiguous cells. All of the riders in orthodox chess are examples of sliders. Riders can create both pins and skewers. One popular fairy chess rider is the nightrider, which can make an unlimited number of knight moves in any direction (like other riders, it cannot change direction partway through its move). The names of riders are often obtained by taking the name of its base leaper and adding the suffix "rider". For example, the zebrarider is a (2,3)-rider. A nightrider can be blocked only on a square one of its component knight moves falls on: if a nightrider starts on a1, it can be blocked on b3 or c2, but not on a2, b2, or b1. It can only travel from a1 to c5 if the intervening square b3 is unoccupied. Some generalised riders do not follow a straight path. The Aanca from the historical game of Grant Acedrex is such a "bent rider": it takes its first step like a ferz and continues outward from that destination like a rook. The unicorn, from the same game, takes its first step like a knight and continues outward from that destination like a bishop. The rose, which is used in chess on a really big board, traces out a path of knight moves on an approximate regular octagon: from e1, it can go to g2, h4, g6, e7, c6, b4, c2, and back to e1. The crooked bishop or boyscout follows a zigzag: starting from f1, its path could take it to e2, f3, e4, f5, e6, f7, and e8 (or g2, f3, g4, f5, g6, f7, and g8). A limited ranging piece moves like a rider, but only up to a specific number of steps. An example is the short rook from Chess with different armies: it moves like a rook, but only up to a distance of 4 squares. From a1, it can travel in one move to b1,