Need help with java

// Ex 7.22 KnightsTour.java
// Simulates the Knight's Tour problem by Euler
 

public class KnightsTourTester {
  public static void main(String[] args) {
    KnightsTour kt = new KnightsTour();
    // Now you can call any public methods from it
    // But I don't know about this particular code in how it's intended to be used.

    kt.begin(0,0);
    kt.begin(7,7);
  }
}

class KnightsTour {
       
        int board[][] = new int[8][8]; // array for the chessboard
        int accessibility[][] = new int[8][8]; // determine the accessibility
        int[] horizontal = {2, 1, -1, -2, -2, -1, 1, 2}; // horizontal movement
        int[] vertical = {-1, -2, -2, -1, 1, 2, 2, 1}; // vertical movement
        int currentRow; // keep track of the current position
        int currentColumn;
        int moveNumber; // select the type of move
        int moveCounter = 0; // count how many moves have taken place
        int hori, vert; // for code shortening
        int possibility = 0; // possible moves counter
        int favorableMove, leastPos; // favorable move
        int tempV, tempH; // temp values
       
        public void begin(int a, int b){ // initializes the values
       
                for(int i = 0; i < board.length; i++){ // initialize board to 0
                        for(int u = 0; u < board[i].length; u++){
                                board[i][u] = 0;
                        } // end inner for
                } // end outer for
               
                runAccess();
               
                currentRow = 7;
                currentColumn = 7;
               
                move();
        } // end begin
       
        public void runAccess(){
               
                for(int i = 0; i < accessibility.length; i++){ // counts the possible moves
                        for(int u = 0; u < accessibility[i].length; u++){
                                currentRow = i;
                                currentColumn = u;
                                access();
                                accessibility[i][u] = possibility;
                        }
                }
               
        }
       
        public void move(){ // attempts to move the knight
               
                board[currentRow][currentColumn] = moveCounter + 1; // mark position as "used"
               
                System.out.printf("Row: %d Column: %d, moveType: %d, moveCount: %d\n", currentRow,
                                currentColumn, moveNumber, moveCounter); // print details for each move
               
                tempH = currentColumn; // store values for access update
                tempV = currentRow;
               
                runAccess();
               
                currentColumn = tempH; // reassign values
                currentRow = tempV;
               
                access();
               
                moveNumber = favorableMove; // move to most favorable square
               
                hori = horizontal[moveNumber]; // to shorten the code
                vert = vertical[moveNumber];
               
                currentRow += vert; // update current position
                currentColumn += hori;
               
                ++moveCounter;
               
                if(moveCounter == 16){
                        System.out.printf("Row: %d Column: %d, moveType: %d, moveCount: %d\n", currentRow,
                                        currentColumn, moveNumber, moveCounter); // details for last move
                        runAccess();
                        finalPrint(); // print the final path
                        System.exit(1); // terminate
                }
                else{
                        move();
                }
        } // end move()
       
        public void finalPrint(){ // prints the order where the knight travelled
                for(int i = 0; i < board.length; i++){
                        for(int u = 0; u < board[i].length; u++){
                                System.out.printf("%2d ", board[u][i]);
                        }
                        System.out.println();
                }
               
        }
 
        public void access(){
               
                moveNumber = 0;
                possibility = 0;
                favorableMove = 0;
                leastPos = 9;
               
                for(int i = 0; i < 8; i++){
                       
                        moveNumber = i; // tries to move the knight with eight different moves
                        hori = horizontal[moveNumber]; // to shorten the code
                        vert = vertical[moveNumber];
                       
                        if(currentRow + vert < accessibility.length && currentColumn + hori
                                        < accessibility[i].length && currentRow + vert >= 0 &&
                                        currentColumn + hori >= 0){ // if move is legal...
                               
                                        if(board[currentRow + vert][currentColumn + hori] == 0){
                                                ++possibility; // if square is not yet visited,
                                                                           // mark it as a possible move
                                                if(accessibility[currentRow + vert][currentColumn + hori] <
                                                                leastPos){
                                                        favorableMove = i;
                                                        leastPos =
                                                                accessibility[currentRow + vert][currentColumn + hori];
                                                }
                                        }      
                        }
                } // end for
               
        }
}

System.out.println("location 123");

  ....  some more code

System.out.println("location 133");