Hjälp med att fylla i några metoder

import java.util.Random;

public class Queens {
	
	public enum Square {

		OCCUPIED ("X"), FREE (".");

		private String message ;

		private Square ( String message ){

		this . message = message ;

		}

		public String toString (){

		return message ;

		}

		}
	
	private Square[][] board;
	private int n;
	
	public Queens(int n)
	{
		this.n = n;
		board = new Square[n][n];
		resetBoard();
		setNewRandomPositioning();
	}
	
	private void resetBoard()
	{
		board = new Square[][]; // Reset the board
	}
	
	public void setNewRandomPositioning()
	{
		board = new Square[][]; //Reset the board
		Random r = new Random();
		n = r.nextInt(); // Fill with random
		board = new Square[n][n]; // Fills the board with n queens
	}
	
	
	private int countQueens()
	{
		int counter = n*n; // If you muliply n*n, you will get number of n in the board
		return counter;		
	}
	
	private boolean isThreatened(int i, int j, int dx, int dy)
	{
		
	}
	
	public boolean borderNotReached()
	{
		
	}
	
	public boolean occupied(int x, int y)
	{
		if(board[x][y] == Square.FREE)
		{
			return false;
		}
		
		return true;
	}

}

import java.util.Random;

public class Queens {
	
	public enum Square {

		OCCUPIED ("X"), FREE (".");

		private String message ;

		private Square ( String message ){

		this . message = message ;

		}

		public String toString (){

		return message ;

		}

		}
	
	private Square[][] board;
	private int n;
	
	public Queens(int n)
	{
		this.n = n;
		board = new Square[n][n];
		resetBoard();
		setNewRandomPositioning();
	}
	
	private void resetBoard()
	{
		board = new Square[][]; // Reset the board
	}
	
	public void setNewRandomPositioning()
	{
		board = new Square[][]; //Reset the board
		Random r = new Random();
		n = r.nextInt(); // Fill with random
		board = new Square[n][n]; // Fills the board with n queens
	}
	
	
	private int countQueens()
	{
		int counter = n*n; // If you muliply n*n, you will get number of n in the board
		return counter;		
	}
	
	private boolean isThreatened(int i, int j, int dx, int dy)
	{
		int x = i;
		int y = j;
		while(borderNotReached())
		{
			x += dx;
			x += dy;
			if(occupied(x, y))
			{
				return true;
			}
			
			else
			{
				continue;
			}
		}
		
		return false;
	}
	
	public boolean borderNotReached()
	{
		if(n > n*n)
		{
			return false;
		}
		
		return true;
	}
	
	public boolean occupied(int x, int y)
	{
		if(board[x][y] == Square.FREE)
		{
			return false;
		}
		
		return true;
	}

}

// TestExample.java                                                                                                                  

// En punkt i rummet                                                                                                                 
class Point
{
    // Punktens koordinater                                                                                                          
    private final double x,y;

    public Point(double x, double y)
    {
        this.x=x;
        this.y=y;
    }

    public double distanceToOrigo()
    {
        return Math.sqrt(x*x+y*y);
    }

    public double distanceToPoint(Point point)
    {
        double dx=x-point.x;
        double dy=y-point.y;
        return Math.sqrt(dx*dx+dy*dy);
    }

    // Sundhetstest. Ordentliga tester bör vara mer heltäckande, men                                                                 
    // om de här testerna inte passeras är något allvarligt fel.                                                                     
    public static boolean test()
    {
        boolean passed = true;

        Point point1 = new Point(1.0, 0.0);
        Point point2 = new Point(-3.0, -4.0);
        if(point1.distanceToOrigo() != 1.0 ||
           point2.distanceToOrigo() != 5.0)
            {
                System.out.println("ERROR : Point.distanceToOrigo");
                passed = false;
            }

        Point point3 = new Point(-1.0, 0.0);

        if(point1.distanceToPoint(point3) != 2.0)
            {
                System.out.println("ERROR : Point.distanceToPoint");
                passed = false;
            }

        // Felaktigt testfall för att visa poängen. Ta bort det här så                                                               
        // passerar programmet testet.                                                                                               
        if(point1.distanceToOrigo() != 666.0)
            {
                System.out.println("ERROR!");
                passed = false;
            }
        // Ta bort hit ned                                                                                                           

        return passed;
    }
}

public class TestExample
{
    public static void main(String[] args)
    {
        if(Point.test())
            System.out.println("   OK");
    }
}