Knight's Tour (works but I can't get the correct grid to print)

Question

Hi all I have written a recursive Knight's tour method.
My trouble is when I print out the final grid it won't show the last position as being filled.
This is where I print out my grid. and it looks like this:
3 6 11 8
0 9 4 1
5 2 7 10
true
//count = number of squares in the grid = done
          else if (count == (rows * cols)){
               for(int i = 0; i < rows; i++){
                    for(int j = 0; j < cols; j++){
                         System.out.print(" " + grid[i][j]);
               System.out.println("");
               return true;
          }This is the complete class
import java.util.Scanner;
public class KnightProblem{
     private int [][] grid;                         //arrays for the grid
     private int rows, cols;                         //size of grid
     private int startx, starty;                    //starting loc.
     private int count = 1;                         //keeps track of counted squares.
     Scanner sc = new Scanner(System.in);     //keyboard input.
     //setter to get grid size, and starting loc.
     public void setGrid(){
          System.out.print("Enter the number of rows: ");
          rows = sc.nextInt();
          System.out.print("Enter the number of columns: ");
          cols = sc.nextInt();
          grid = new int[rows][cols];
          System.out.print("Enter starting location, rows space column: ");
          startx = sc.nextInt();
          starty = sc.nextInt();
               if(startx < 0 || startx >= rows || starty < 0 ||
                         starty >= cols){ //check start loc falls inside grid
                    System.out.println("Your starting location does not fall inside the grid" +
                                   " please try again.");
                    System.exit(0);
          System.out.print("Your " + rows + " by " + cols + " grid has been created, ");
          System.out.print("with a starting location of " + "(" + startx + "," +
                              " " + starty + ")");
          System.out.println();
          for(int i = 0; i < rows; i++){
               for(int j = 0; j < cols; j++){
                    grid[i][j] = 0;
     //method to try and fill the grid
     public boolean isFill(){
          return isFill(startx, starty, count);               //call recursive method.
     //recursive method to fill the grid
     private boolean isFill(int x, int y, int count){
          //base case current loc outside grid
          if (x < 0 || x >= rows || y < 0 || y >= cols){
               //System.out.println("1st if " + count);
               return false;
          //current location already has a number
          else if(grid[x][y] > 0){
               return false;
          //count = number of squares in the grid = done
          else if (count == (rows * cols)){
               for(int i = 0; i < rows; i++){
                    for(int j = 0; j < cols; j++){
                         System.out.print(" " + grid[i][j]);
               System.out.println("");
               return true;
          else{
               grid[x][y] = count;          //set Count to current loc.
               count++;
               //if there is an empty space from one of the current neighbors then there
               //is an open space from current loc.
               if (isFill(x-2, y-1, count) || isFill(x-2, y+1, count) || isFill(x-1, y+2, count)
                     || isFill(x+1, y+2, count) || isFill(x+2, y+1, count) || isFill(x+2, y-1, count)
                     || isFill(x+1, y-2, count) || isFill(x-1, y-2, count)){
                    return true;
               else{
                    grid[x][y] = 0;
                    return false;
}     tester code
public class KnightTest{
     public static void main (String[] args){
          KnightProblem knight = new KnightProblem();
          knight.setGrid();
          System.out.println(knight.isFill());
}full output:
Enter the number of rows: 3
Enter the number of columns: 4
Enter starting location, rows space column: 1 3
Your 3 by 4 grid has been created, with a starting location of (1, 3)
3 6 11 8
0 9 4 1
5 2 7 10
true
Could anyone explain why that 0 isn't a 12?

Answer 1

I figured it out after a little thinking!
else if (count == (rows * cols)){
               grid[x][y] = count; // new code since last post.
               for(int i = 0; i < rows; i++){
                    for(int j = 0; j < cols; j++){
                         System.out.print(" " + grid[i][j]);
               System.out.println("");
               return true;Before I wasn't giving it a chance to update the count one last time.