About this document
Hill Climbing for 8-Queens Problem by angel.pari.mudit is a document available to read on EtoBox.
The assignment for CS2203 focuses on applying various Hill Climbing algorithm variants to solve the 8-Queens problem, which involves placing 8 queens on a chessboard without them threatening each other. Students are required to implement and analyze First Choice, Steepest Ascent, Random Restart, and Stochastic Hill Climbing algorithms, and conduct experimental analysis on their performance. A detailed report in PDF format must be submitted by the deadline, including code that prompts for initial state and a
- Author
- angel.pari.mudit
- Language
- EN