Open AccessA New Perspective of Paramodulation Complexity by Solving 100 Sliding Block Puzzles
Author(s) -
Ruo Ando,
Yoshiyasu Takefuji
Publication year - 2021
Publication title -
international journal of artificial intelligence and applications
Language(s) - English
Resource type - Journals
eISSN - 0976-2191
pISSN - 0975-900X
DOI - 10.5121/ijaia.2021.12604
Subject(s) - perspective (graphical) , inference , block (permutation group theory) , computer science , theoretical computer science , algorithm , mathematics , artificial intelligence , combinatorics
This paper gives complete guidelines for authors submitting papers for the AIRCC Journals. A sliding puzzle is a combination puzzle where a player slides pieces along specific routes on a board to reach a certain end configuration. In this paper, we propose a novel measurement of the complexity of 100 sliding puzzles with paramodulation, which is an inference method of automated reasoning. It turned out that by counting the number of clauses yielded with paramodulation, we can evaluate the difficulty of each puzzle. In the experiment, we have generated 100 * 8 puzzles that passed the solvability checking by countering inversions. By doing this, we can distinguish the complexity of 8 puzzles with the number generated with paramodulation. For example, board [2,3,6,1,7,8,5,4, hole] is the easiest with score 3008 and board [6,5,8,7,4,3,2,1, hole] is the most difficult with score 48653.Besides, we have succeeded in obverse several layers of complexity (the number of clauses generated) in 100 puzzles. We can conclude that the proposed method can provide a new perspective of paramodulation complexity concerning sliding block puzzles.