How to correctly write a maze algorithm using loops

I am writing a code for a class assignment to get a character through a maze. I have been working on this for hours and I can't figure out what I am doing wrong. The character moves left to right and right to left. Except when I add the code to have the character move around a block if (maze.moveRight() == false), it causes the character to move up and down at the end of each row a bunch of times before it moves the other direction. Also it messes up my count as the character moves across the rows. I feel like I am making it much more complicated than it should be. Can someone help?

Algorithm

1. The student always starts at the top left corner, that is row and column zero.

2. The Java logo can be anywhere in the maze, which also contains obstacles shown as "Wrong Way" signs.

3. You must traverse every row in the maze from top to bottom according to the rules below, until you find the Java logo.

4. Row and column numbers are zero based, so the first row and column is index 0. the second row and column is index 1, and so on. The number zero is even.

5. On even rows, you must move left to right using maze.moveRight(), on odd rows, you must move right to left using maze.moveLeft().

6. After completing each row, use maze.moveDown() to proceed to the next row, until you reach the last row or find the Java logo.

7. You can detect that you have encountered an obstacle by checking the return value from move methods in the Maze object, true means no obstacle, false means obstacle.

8. If you run into an obstacle when when moving left to right: Move down, right, right, and up. Adjustment the loop counter for the extra move right!

9. If you run into an obstacle when when moving right to left: Move down, left, left, and up. Adjustment the loop counter for the extra move left!

10. Every time you move left or right, not including when avoiding an obstacle, you must call maze.isDone() to see if you have found the Java logo.

11. When you find the Java logo, you must immediately break out of all loops, and exit the program.

12. There are mazes that cannot be solved using the algorithm, but we will not test your program with any of them.

public static void main(String[] args) {
    // Create maze
    String fileName = args[1];
    Maze maze = new Maze(fileName);
    System.out.println("Maze name: " + fileName);

    // Get dimensions
    int mazeWidth = maze.getWidth();
    int mazeHeight = maze.getHeight();

    // Print maze size
    System.out.println("Maze width: " + mazeWidth);
    System.out.println("Maze height: " + mazeHeight);

    int r = 0;
    int c = 0;
    // Move commands

    while (c < maze.getWidth() - 1 && r % 2 == 0 && maze.isDone() == false)
    {
        maze.moveRight();
        maze.isDone();
        c++;

        if (maze.moveRight() == false && maze.isDone() == false){
            maze.moveDown();
            maze.moveRight();
            maze.moveRight();
            maze.moveUp();
        }

        if (maze.isDone() == true){
            System.exit(1);
        }
    }

    while (c == maze.getWidth() - 1 && r % 2 == 0 && maze.isDone() == false)
    {
        maze.moveDown();
        maze.isDone();
        r++;
    }

    while (c != 0 && c <= maze.getWidth() -1 && r % 2 != 0 
      && maze.isDone() == false){
        maze.moveLeft();
        maze.isDone();
        c--;

        if (maze.moveLeft() == false && maze.isDone() == false) {
            maze.moveDown();
            maze.moveLeft();
            maze.moveLeft();
            maze.moveUp();
        }

        if (maze.isDone() == true){
            System.exit(1);
        }
    }
}