static int runTestCase(int casenum__) {
		switch (casenum__) {
		case 0: {
			int n = 3;
			String initPosition = "b2";
			String expected__ = "b2-c2-c3-b3-a3-a2-a1-b1-c1";

			return verifyCase(casenum__, expected__, new DukeOnChessBoard().dukePath(n, initPosition));
		}
		case 1: {
			int n = 4;
			String initPosition = "d4";
			String expected__ = "d4-d3-d2-d1-c1-c2-c3...b3-b2-b1-a1-a2-a3-a4";

			return verifyCase(casenum__, expected__, new DukeOnChessBoard().dukePath(n, initPosition));
		}
		case 2: {
			int n = 3;
			String initPosition = "a2";
			String expected__ = "a2-b2-c2-c3-b3-a3";

			return verifyCase(casenum__, expected__, new DukeOnChessBoard().dukePath(n, initPosition));
		}
		case 3: {
			int n = 4;
			String initPosition = "d3";
			String expected__ = "d3-d4-c4-c3-c2-d2-d1...b2-b3-b4-a4-a3-a2-a1";

			return verifyCase(casenum__, expected__, new DukeOnChessBoard().dukePath(n, initPosition));
		}
		case 4: {
			int n = 8;
			String initPosition = "a8";
			String expected__ = "a8-b8-c8-d8-e8-f8-g8...a1-a2-a3-a4-a5-a6-a7";

			return verifyCase(casenum__, expected__, new DukeOnChessBoard().dukePath(n, initPosition));
		}

		// custom cases

		/*
		 * case 5: {
		 * int n = ;
		 * String initPosition = ;
		 * String expected__ = ;
		 * 
		 * return verifyCase(casenum__, expected__, new
		 * DukeOnChessBoard().dukePath(n, initPosition));
		 * }
		 */
		/*
		 * case 6: {
		 * int n = ;
		 * String initPosition = ;
		 * String expected__ = ;
		 * 
		 * return verifyCase(casenum__, expected__, new
		 * DukeOnChessBoard().dukePath(n, initPosition));
		 * }
		 */
		/*
		 * case 7: {
		 * int n = ;
		 * String initPosition = ;
		 * String expected__ = ;
		 * 
		 * return verifyCase(casenum__, expected__, new
		 * DukeOnChessBoard().dukePath(n, initPosition));
		 * }
		 */
		default:
			return -1;
		}
	}