Pseudocode for N-Queens

• repeat these steps

  • if there are no conflicts with the queens...

Increase filled by 1. If filled is now N, then

the algorithm is done. Otherwise, move to

the next row and place a queen in the

first column.

Previous slide

Next slide

Back to first slide

View graphic version