The N queens problem - new variants of the Wirth algorithm

Marcin Łajtar

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].

Full Text:

PDF


DOI: http://dx.doi.org/10.2478/v10065-012-0013-3
Date of publication: 2015-01-04 00:00:00
Date of submission: 2016-04-28 09:09:38


Statistics


Total abstract view - 535
Downloads (from 2020-06-17) - PDF - 0

Indicators



Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.