This puzzle is based on this wonderful [puzzle](https://puzzling.stackexchange.com/questions/25460/trapping-the-knight).

A fairy chess piece is placed on an infinitely large chess board with no edges. It can only visit each square once. What is the smallest number of moves it can make that would cause it to become trapped?

I am interested in answers for the following fairy chess pieces:

* [Ferz](https://en.wikipedia.org/wiki/Ferz): moves 1 square diagonally in any direction.
* [Camel](https://en.wikipedia.org/wiki/Camel_(chess)): moves 1 square in a horizontal/vertical direction followed by 3 squares in an orthogonal direction.
* [Zebra](https://en.wikipedia.org/wiki/Zebra_(chess)): moves 2 squares in a horizontal/vertical direction followed by 3 squares in an orthogonal direction.
* [Giraffe](https://en.wikipedia.org/wiki/Giraffe_(chess)): moves 1 square in a horizontal/vertical direction followed by 4 squares in an orthogonal direction.