## 15. A knight travels around the board ... (1 point)

A knight starts from square a1, and travels around the board to square h1, then to h8, a8 and returns back to a1. What is the minimum number of moves, that this trip can be accomplished?

Manolis Stratakis: stratakis@forthnet.gr