Construct Proof Game in which Knight makes polygon (virtually connect centres of visited squares) of the greatest area. The polygon can be of any shape. Thematic moves must be consecutive. During thematic play Knight cannot cross its moving path. The polygon is closed when the thematic Knight reaches the square at which it has already been. Promoted Knight can also be thematic. The thematic side can play non-Knight moves (preparing position for thematic play). Only one solution is allowed. Fairy pieces and conditions are not allowed. Send your compositions to e-mail: problem@problemonline.com. Closing date: 12th August 2005.

Main criterion for ranking will be area expressed in chess-squares (more is better).
First additional criterion will be total number of moves (less is better).
Second additional criterion will be number of captures by thematic N (less is better).

Here are three basic examples:
Example1. 1.d4 Sf6 2.d5 Sxd5 3.Sc3 Sxc3 4.Qd5 Se4 5.Kd1 Sf6
Example2. 1.Sf3 e5 2.Sxe5 Ke7 3.Sxf7 Kf6 4.Sg5 Kg6 5.Sf3
Example3. 1.e4 Sc6 2.e5 Sxe5 3.d3 Sxd3+ 4.Ke2 Sb4 5.Kf3 Sc6

Rank   Author        Area↑   Moves↓   Captures↓
===============================================
 1.    Example3        5      5,0        2
 2.    Example2        4      4,5        2
 3.    Example1        3      5,0        2

Because ranking can be easily calculated we do not need a judge. The calculations will be done by the editor (Ivan Bender). We plan to update temporary ranking weekly.

Somewhat complicated example for calculating the area of polygon:

The minimum is 3 squares, while the maximum is 37. Good luck!