Can someone help with an algorithm to solve the 8-queens problem using Java

Question

School work

Answer 1

the algorithm should start by placing a queen somewhere then the algorithm should go trow all queens and look which places on the board are ok to place a queen.
Then it should place one queen on the ok spots.
if the algorithm fails to place 8 queens all queens are removed and the starting position oft the first queen is changed.

helps?

Answer 2

use maybe an arraylist

Answer 3

good luck Frigate !