Leapers coverings (Jean-Charles Meyrignac)

Discuss about this problem

The problem is to place the smallest number of leapers http://en.wikipedia.org/wiki/Fairy_chess_piece#Leapers on NxN boards, so that they attack or occupy every square. This problem has been described in a Martin Gardner's column, and has been quite extensively explored with the knight leaper: http://www.contestcen.com/knight.htm http://home.earthlink.net/~morgenstern/ A006075 With other leapers and boards varying from 8*8 to 52*52 Place the minimal number of leapers so that all the squares of a N*N board are attacked.