(Science International, 2015) Ali, Javaid; Muhammad Saeed; Tabassum, Muhammad Farhan
Most of the optimization methods do not inherit convergence proofs. One of the measures to rank them is their
potential to solve challenging problems specially formulated for this purpose. In this paper the problem involves two main
issues. Firstly we present new formulations of the N queens’ configuration problem as optimization problems and secondly we
modify a derivative free method so that it may be able to find the optimal configuration of the chessboard.