期刊名称:International Journal of Computer Science and Network
印刷版ISSN:2277-5420
出版年度:2012
卷号:1
期号:5
出版社:IJCSN publisher
摘要:In this paper we have discussed variant of systematic and repairstrategies for N queen’s problem for different positions and size ofboard of problem space. We introduce the intelligent Heuristicsearch algorithm for solving the N queen’s problem with differentsize of board positions. The intelligent Heuristic search algorithm,that we propose here is based on major part of local searchmethods and backtrack systematic search. The algorithm is moreinteractive behavior in the strategy of changing the task during thesearch. Algorithm separates the hard and soft constraints and allthe hard constraints have to be completely satisfied while the softconstraints do not required being satisfied. we compare theproduced result with another systematic search algorithm andanalysis their results and performance
关键词:Constrains; Algorithms; Repair; Backtracking; L;Heuristic; State