The goal of this thesis is to solve the well-known 8-queens puzzle, which involves arranging eight queens on a chessboard so that none of them can attack one another. The thesis investigates different locations for the queens and looks for conflicts to identify workable arrangements using Prolog, a programming language that works well for logic-based problems. In addition to providing techniques for visualizing the solutions, it demonstrates how well Prolog handles constraint problems such as this one. The thesis also explores how this method can be used to solve related logic problems in the future, demonstrating Prolog's potential for innovative problem-solving.