A Famous Chess Problem.
Reading edition
This is a famous problem, and several notable chess-players of the old school have amused themselves with it:
To make the knight move into all the squares of the chess-board in succession, without passing twice over the same.
Of the four solutions to the problem, Demoivre's is the easiest to follow. I will furnish Montmort's, Mairan's, or M. W——'s solution to any member so desiring, provided a stamp is sent for reply. Following is Demoivre's solution:
344932113639241
2110355023123740
483362573825213
92051563604126
324758615653143
198555259642742
46316174429415
71845305164328
Vincent V. M. Beede, R. T. F. 17 Webster Place, East Orange, N. J.