This document describes an approach to solving the N-Queens problem using the Min-Conflicts artificial intelligence algorithm. The N-Queens problem involves placing N queens on an NxN chessboard so that no two queens attack each other. The Min-Conflicts algorithm works by randomly selecting a queen and relocating it to a position with fewer conflicts, or by selecting a new queen if no such position exists. The algorithm is shown to find the unique solution to the problem in polynomial time for sample board sizes. Potential applications of the algorithm include scheduling and VLSI design problems.