| dc.description.abstract | Since the beginning of AI, mind games, such as Chess, have been studied as application fields for AI. Several variation of chess related problems have been shown to be NP-complete. This research deals with the problem of Mate in One Puzzles. We employ Answer Set Programming (ASP) to tackle this problem. ASP has been, in the last decade, the subject of active research in the field of logic programming, knowledge representation, and reasoning. ASP allows for an intuitive representation of computationally hard problems as well as efficient solving using state-of-the-art solvers, such as DLV. In this research, a representation of Mate In One Puzzles has been formulated and a prototype application system written using PHP and DLV has also been implemented. Experimental results show that the system is capable of generating solutions for Mate in One problem efficiently. However, the representation is still not efficient enough to be used for more difficult class of problems such as Mate in Two and Mate in Three. | en |
