Solution found to the 8-queens problem in 3 iterations:

The n-queens problem is the problem of finding a stable state solution to a chess game with a board size of n x n, and n queens on the board. a stable solution is one in which no queen can better her position by moving. This problem is relatively simple, as illustrated by the speed at which this page loads; the script which generates this page had to solve the problem first.