The N queens problem - new variants of the Wirth algorithm
Marcin Łajtar · Annales Universitatis Mariae Curie-Sklodowska sectio AI – Informatica · 2013
The paper presents new ways of n-queens problem solving . Briefly,this is a problem on a nxn chessboard of a set n-queens, so that any two of themare not in check. At the beginning, currently used algorithm to find solutions isdiscussed. Then sequentially 4 new algorithms, along with the interpretation ofchanges are given. The research results, including comparison, of calculation timesof all algorithms together with their interpretation are discussed. Finally, conclusionsare given. The results were obtained thanks to the pre-created application.Chapters except for By filtering ver. 2 were based on the previous studies carriedout during the Bachelor course [1].