client/src/translations/rules/Hamilton/en.pug

   1 p.boxed
   2   | Click on an empty square to start the game.
   3   | The first player unable to move the knight loses.
   4
   5 p.
   6   White puts a knight on any square of an empty chessboard.
   7   Black moves the knight, and its initial square vanish:
   8   the knight will no longer be able to land on that square.
   9   Play alternates, always with the vanishing initial square condition.
  10   The first player unable to make a move loses.
  11
  12 figure.diagram-container
  13   .diagram
  14     | fen:3xx2x/1x1xNxx1/2xxxxxx/xxxxxx2/2xxxxx1/x1xxxx2/1xxxxx2/1x2xx2 g8,c8:
  15   figcaption Ng8 wins, but Nc8 loses because it allows Na7.
  16
  17 p
  18   | Note about the name: when the game ends, the knight has walked on an
  19   a(href="https://en.wikipedia.org/wiki/Hamiltonian_path") Hamiltonian path
  20   | &nbsp;considering the subgraph formed by all the removed squares
  21   | plus the final square.
  22
  23 p
  24   | Inventor: David Silverman (1971) according to
  25   a(href="https://www.jsbeasley.co.uk/encyc.htm")
  26     | The Classified Encyclopedia of Chess Variants
  27   | . The game idea is probably quite older.