N-Queens Algorithm

Date Completed: December 2017

University Year 1 Term 1

An introductory task to our Year 1 Artifical Intelligence module, the N-Queens problem is to design a program that can place 8 queens on a chessboard so that none of them can take each other, in the smallest amount of attempts possible. My implementation awarded me a 1st grade mark due to the optimised breadth-first search algorithm implemented.

Figure2.jpg