A Famous Chess Problem.

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:

34	49	32	11	36	39	24	1
21	10	35	50	23	12	37	40
48	33	62	57	38	25	2	13
9	20	51	5	63	60	41	26
32	47	58	61	56	53	14	3
19	8	55	52	59	64	27	42
46	31	6	17	44	29	4	15
7	18	45	30	5	16	43	28

Vincent V. M. Beede, R. T. F.
17 Webster Place, East Orange, N. J.

34	49	32	11	36	39	24	1
21	10	35	50	23	12	37	40
48	33	62	57	38	25	2	13
9	20	51	5	63	60	41	26
32	47	58	61	56	53	14	3
19	8	55	52	59	64	27	42
46	31	6	17	44	29	4	15
7	18	45	30	5	16	43	28

34	49	32	11	36	39	24	1
21	10	35	50	23	12	37	40
48	33	62	57	38	25	2	13
9	20	51	5	63	60	41	26
32	47	58	61	56	53	14	3
19	8	55	52	59	64	27	42
46	31	6	17	44	29	4	15
7	18	45	30	5	16	43	28

34	49	32	11	36	39	24	1
21	10	35	50	23	12	37	40
48	33	62	57	38	25	2	13
9	20	51	5	63	60	41	26
32	47	58	61	56	53	14	3
19	8	55	52	59	64	27	42
46	31	6	17	44	29	4	15
7	18	45	30	5	16	43	28