Analysis of tree based search techniques for solving 8-puzzle problem

Arpan Kumar Mishra, P. C. Siddalingaswamy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The 8-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The more general n-puzzle is a classical problem which can be solved using graph search techniques. The problem of finding the optimal solution is NP-hard. In this paper, we analyze the performance of various informed and uninformed search techniques for finding the optimal solution for a solvable goal state of the 8 puzzle. For using the uninformed search techniques, the problem is converted into a game tree and all of the states are examined till we find the goal. In case of informed search techniques, we do not examine all of the states. Essentially, a search tree which is a component of the game tree is built. In a search tree, we make use of an appropriate heuristic which guides us to take a decision from a current state to the next state in an intelligent manner and hence the state space is significantly reduced resulting in memory and time optimization.

Original languageEnglish
Title of host publication2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-5
Number of pages5
Volume2017-January
ISBN (Electronic)9781509056828
DOIs
Publication statusPublished - 02-01-2017
Event2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017 - Vellore, India
Duration: 21-04-201722-04-2017

Conference

Conference2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017
CountryIndia
CityVellore
Period21-04-1722-04-17

Fingerprint

Tile
Search Trees
Optimal Solution
Game
Square number
Graph Search
Data storage equipment
State Space
NP-complete problem
Heuristics
Optimization

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Computer Science Applications
  • Energy Engineering and Power Technology
  • Renewable Energy, Sustainability and the Environment
  • Artificial Intelligence
  • Computer Networks and Communications

Cite this

Mishra, A. K., & Siddalingaswamy, P. C. (2017). Analysis of tree based search techniques for solving 8-puzzle problem. In 2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017 (Vol. 2017-January, pp. 1-5). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPACT.2017.8245012
Mishra, Arpan Kumar ; Siddalingaswamy, P. C. / Analysis of tree based search techniques for solving 8-puzzle problem. 2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017. Vol. 2017-January Institute of Electrical and Electronics Engineers Inc., 2017. pp. 1-5
@inproceedings{9d114e1fdfe24e56b7b25fe971ce13e0,
title = "Analysis of tree based search techniques for solving 8-puzzle problem",
abstract = "The 8-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The more general n-puzzle is a classical problem which can be solved using graph search techniques. The problem of finding the optimal solution is NP-hard. In this paper, we analyze the performance of various informed and uninformed search techniques for finding the optimal solution for a solvable goal state of the 8 puzzle. For using the uninformed search techniques, the problem is converted into a game tree and all of the states are examined till we find the goal. In case of informed search techniques, we do not examine all of the states. Essentially, a search tree which is a component of the game tree is built. In a search tree, we make use of an appropriate heuristic which guides us to take a decision from a current state to the next state in an intelligent manner and hence the state space is significantly reduced resulting in memory and time optimization.",
author = "Mishra, {Arpan Kumar} and Siddalingaswamy, {P. C.}",
year = "2017",
month = "1",
day = "2",
doi = "10.1109/IPACT.2017.8245012",
language = "English",
volume = "2017-January",
pages = "1--5",
booktitle = "2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Mishra, AK & Siddalingaswamy, PC 2017, Analysis of tree based search techniques for solving 8-puzzle problem. in 2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017. vol. 2017-January, Institute of Electrical and Electronics Engineers Inc., pp. 1-5, 2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017, Vellore, India, 21-04-17. https://doi.org/10.1109/IPACT.2017.8245012

Analysis of tree based search techniques for solving 8-puzzle problem. / Mishra, Arpan Kumar; Siddalingaswamy, P. C.

2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017. Vol. 2017-January Institute of Electrical and Electronics Engineers Inc., 2017. p. 1-5.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Analysis of tree based search techniques for solving 8-puzzle problem

AU - Mishra, Arpan Kumar

AU - Siddalingaswamy, P. C.

PY - 2017/1/2

Y1 - 2017/1/2

N2 - The 8-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The more general n-puzzle is a classical problem which can be solved using graph search techniques. The problem of finding the optimal solution is NP-hard. In this paper, we analyze the performance of various informed and uninformed search techniques for finding the optimal solution for a solvable goal state of the 8 puzzle. For using the uninformed search techniques, the problem is converted into a game tree and all of the states are examined till we find the goal. In case of informed search techniques, we do not examine all of the states. Essentially, a search tree which is a component of the game tree is built. In a search tree, we make use of an appropriate heuristic which guides us to take a decision from a current state to the next state in an intelligent manner and hence the state space is significantly reduced resulting in memory and time optimization.

AB - The 8-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The more general n-puzzle is a classical problem which can be solved using graph search techniques. The problem of finding the optimal solution is NP-hard. In this paper, we analyze the performance of various informed and uninformed search techniques for finding the optimal solution for a solvable goal state of the 8 puzzle. For using the uninformed search techniques, the problem is converted into a game tree and all of the states are examined till we find the goal. In case of informed search techniques, we do not examine all of the states. Essentially, a search tree which is a component of the game tree is built. In a search tree, we make use of an appropriate heuristic which guides us to take a decision from a current state to the next state in an intelligent manner and hence the state space is significantly reduced resulting in memory and time optimization.

UR - http://www.scopus.com/inward/record.url?scp=85045852368&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85045852368&partnerID=8YFLogxK

U2 - 10.1109/IPACT.2017.8245012

DO - 10.1109/IPACT.2017.8245012

M3 - Conference contribution

VL - 2017-January

SP - 1

EP - 5

BT - 2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Mishra AK, Siddalingaswamy PC. Analysis of tree based search techniques for solving 8-puzzle problem. In 2017 Innovations in Power and Advanced Computing Technologies, i-PACT 2017. Vol. 2017-January. Institute of Electrical and Electronics Engineers Inc. 2017. p. 1-5 https://doi.org/10.1109/IPACT.2017.8245012