Abstract
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].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.