Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/20860
Title: | Efficient optimization to the N Queens Problem |
Authors: | Hadj Mohammed, Djamel |
Keywords: | Artificial Intelligence(AI) Hybrid Search, Heuristic Algorithm The N Queens problem |
Issue Date: | 5-Mar-2019 |
Publisher: | Université Kasdi Merbah Ouargla |
Series/Report no.: | 2019; |
Abstract: | We present an efficient solution to the N-Queens puzzle using the heuristic algorithm proposed in the paper. The N-Queens problem become intractable for large values of N and this placed in NP (No deterministic Polynomial) class problem because of their high complexity (eg: O(N!) , O(2N )) they cannot solved in a realistic time frame using deterministic technique, very efficient AI (Artificial Intelligence) search algorithm solving strategies, even classic Local Search algorithm developed so far cannot find a solution for large size N-Queens problem in a reasonable time, in this paper we present a new optimization that combine the Local Search algorithm and our proposed heuristic algorithm which is based on a specific generated N- Queens Starting states. This efficient optimization is capable of finding a solution for extremely large size Queens number in O(N), we give the execution statistics for this hybrid algorithm with number of Queens up to 19,000,000 in less than one second. |
Description: | Le 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019 |
URI: | http://dspace.univ-ouargla.dz/jspui/handle/123456789/20860 |
Appears in Collections: | 2. Faculté des nouvelles technologies de l’information et de la communication |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Hadj Mohammed Djamel.pdf | 559,56 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.