Comp 170-H

Programming Assignment 3 - A Knights Tour

Due Tuesday, October 14 2003.

Extra Credit: 1 Seminar Attendance per day early

Move indices:

	2		1
3				0
		K
4				7
	5		6

const long HorizonalMoves[] = { 2, 1,-1,-2,-2,-1, 1, 2};

const long VerticalMoves[] = {-1,-2,-2,-1, 1, 2, 2, 1};

Requirements:

• You must use the backtracking method as described in class to solve the Knights Tour.
• Your must ask the user where to start.

Tips:

• You should have a loop somewhere that continues until the MoveCount == 64.
• You should have three arrays of longs as shown below, each containing 64 elements.

Example Run in Progress:

	0	1	2	3	4	5	6	7		RowMoveHistory	ColumnMoveHistory	DirectionHistory
0	7	0	0	12	5	10	17	22	0	7	7	2
1	0	13	6	9	16	21	4	19	1	5	6	1
2	0	8	15	0	11	18	23	0	2	3	7	2
3	14	0	0	0	24	0	20	3	3	1	6	3
4	0	0	0	0	0		0	0	4	0	4	4
5	0	0	0	0	0	0	2	0	5	1	2	3
6	0	0	0	0	0	0	0	0	6	0	0	6
7	0	0	0	0	0	0	0	1	7	2	1	0
									8	1	3	0
									9	0	5	5
	Move Count								10	2	4	2
	24								11	0	3	4
									12	1	1	5
									13	3	0	0
									14	2	2	0
									15	1	4	0
									16	0	6	5
									17	2	5	0
									18	1	7	5
									19	3	6	2
									20	1	5	0
									21	0	7	5
									22	2	6	4
									23	3	4	0