# Camel-eon 8x8 tour

This question is inspired by the Chameleon 8x8 tour puzzle.

A knight is a chess piece that moves by jumping to a square $$\sqrt 5$$ units from its location. (The more conventional way to put it is that it can move two steps horizontally and one step vertically, or two steps vertically and one step horizontally.)

A camel is a "fairy chess piece" not present in the regular rules of chess; it moves by jumping to a square $$\sqrt{10}$$ units from its location. (The more conventional way to put it is that it can move three steps horizontally and one step vertically, or three steps vertically and one step horizontally.)

In this puzzle, the piece you have is a "camel-eon". The camel-eon starts out as a knight, but it will transform into a camel after making its first move, then transform back into a knight after making its second move, and so on: transforming after every move. For example, here is a diagram of several moves of a camel-eon starting from the bottom left corner of a chessboard. Camel moves are marked in red, knight moves are marked in blue.

Can you find a closed camel-eon tour of the $$8 \times 8$$ chessboard? That is, can you find a sequence of moves (starting from anywhere you like - it doesn't matter) that visit every square exactly once, and return to the starting point?

To be clear, both pieces move by jumping: they go from the starting square of the jump directly to the ending square, without passing through any of the squares in between.

• Nice puzzle! We can probably make puzzles for all piece combinations. Dec 3, 2021 at 7:16
• This is the only one with a pun, though :) Dec 3, 2021 at 15:12