research-article

Solving the 8-puzzle problem using genetic programming

Authors:

SAICSIT '13: Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference

Pages 64 - 67

https://doi.org/10.1145/2513456.2513492

Published: 07 October 2013 Publication History

Get Access

Abstract

The 8-puzzle problem is a classic artificial intelligence problem which has been well-researched. The research in this domain has focused on evaluating traditional search methods such as the breadth-first search and the A* algorithm and deriving and testing various heuristics for use with informed searches to solve the 8-puzzle problem. The study presented in this paper evaluates a machine learning technique, namely genetic programming, as means of solving the 8-puzzle problem. The genetic programming algorithm uses the grow method to create an initial population which is iteratively refined using tournament selection to choose parents which the reproduction, mutation and crossover operators are applied to, thereby producing successive generations. The edit operator has been used to exert parsimony pressure in order to reduce the size of solution trees and hence the number of moves to solve a problem instance. The genetic programming system was successfully applied to 20 problem instances of differing difficulty, producing solutions to all 20 problems. Furthermore, for a majority of the problems the solutions produced solve the problem instance using the known minimum number of moves.

References

[1]

Reinefeld, A. 1993. Complete Solution of the EightPuzzle Problem and the Benefit of Node Ordering in IDA*. In Proceedings of the 13th Joint Conference on Artificial Intelligence (IJCAI '93), Vol. 1, 248--253, Morgan Kaufmann Publishers, Inc., USA.

Digital Library

Google Scholar

[2]

Kunkle, D. R. 2001. Solving the 8 Puzzle Problem in a Minimum Number of Moves: An Application of the A* Algorithm. http://web.mit.edu/6.034/wwwbob/EightPuzzle.pdf. Accessed 31 May 2013.

Google Scholar

[3]

Bhasin, H., Singla, N. 2012. Genetic Based Algorithms for N-Puzzle Problem. International Journal of Computer Applications, Vol. 51, No. 22, 44--50.

Crossref

Google Scholar

[4]

Luger, G. F., Stubblefield, W. 1998. Artificial Intelligence: Structures and Strategies for Complex Problem Solving. Addison-Wesley Longman.

Digital Library

Google Scholar

[5]

Shaban, R. Z., Alkallak, I. N., Sulaiman, M. M. 2010. Genetic Programming to Solve Sliding Tile 8-Puzzle Problem. Journal of Education and Science, Vol. 23, No. 3, 145--157.

Crossref

Google Scholar

[6]

Banzhaf, W., Nordin, P., Keller, R. E., Francone, F. D. 1998. Genetic Programming - An Introduction - On the Automatic Evolution of Computer Programs and its Applications, Morgan Kaufmann Publishers, Inc.

Digital Library

Google Scholar

[7]

Barnes, J. M., Hasan, S. H., Lee, S. 2006. Solving the 8-Puzzle Problem: A Genetic Programming Approach. http://sha.ddih.org/f/Barnes-Hasan-Lee-Project-3.pdf. Accessed 31 May 2013.

Google Scholar

[8]

Marshall, C. 2007. Heuristics for Solving the Eight Puzzle Problem. http://www.soe.ucsc.edu/~csm/240/Report.pdf. Accessed 31 May 2013.

Google Scholar

[9]

Koza, J. R. 1992. Genetic Programming I: On the Programming of Computers by Means of Natural Selection, MIT Press.

Digital Library

Google Scholar

Cited By

View all

Qatish D(2023)Informedness and Effectiveness in Search: Heuristic Simplicity and Algorithm Complexity2023 IEEE 3rd International Maghreb Meeting of the Conference on Sciences and Techniques of Automatic Control and Computer Engineering (MI-STA)10.1109/MI-STA57575.2023.10169436(12-17)Online publication date: 21-May-2023
https://doi.org/10.1109/MI-STA57575.2023.10169436
Dirgová Luptáková IPospíchal J(2021)Transition Graph Analysis of Sliding Tile Puzzle HeuristicsRecent Advances in Soft Computing and Cybernetics10.1007/978-3-030-61659-5_13(149-156)Online publication date: 6-Feb-2021
https://doi.org/10.1007/978-3-030-61659-5_13
Liu CHuang SAkmal Khalid MIida H(2020)Attractiveness of Single-Agent Game: Case Study Using Sliding Puzzle2020 International Conference on Advanced Information Technologies (ICAIT)10.1109/ICAIT51105.2020.9261794(76-81)Online publication date: 4-Nov-2020
https://doi.org/10.1109/ICAIT51105.2020.9261794

Index Terms

Solving the 8-puzzle problem using genetic programming
1. Computing methodologies
  1. Artificial intelligence
    1. Philosophical/theoretical foundations of artificial intelligence

Recommendations

A genetic programming approach to the generation of hyper-heuristics for the uncapacitated examination timetabling problem
EPIA'07: Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence

Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second takes an indirect approach to the problem and examines the generation of ...
Solving the 0/1 knapsack problem using an adaptive genetic algorithm

Probabilistic and stochastic algorithms have been used to solve many hard optimization problems since they can provide solutions to problems where often standard algorithms have failed. These algorithms basically search through a space of potential ...
A genetic programming approach for solving the linear ordering problem
HAIS'12: Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II

The linear ordering problem (LOP) consists in rearranging the rows and columns of a given square matrix such that the sum of the super-diagonal entries is as large as possible. The LOP has a significant number of important practical applications. In ...

Comments

Information & Contributors

Information

Published In

SAICSIT '13: Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference

October 2013

398 pages

ISBN:9781450321129

DOI:10.1145/2513456

Conference Chairs:
John McNeill,
Karen Bradshaw,
Editors:
Philip Machanick,
Mosiuoa Tsietsi

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 October 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SAICSIT '13

Sponsor:

Amazon
Rhodes Univ.
IBM

SAICSIT '13: 2013 South African Institute for Computer Scientists and Information Technologists

October 7 - 9, 2013

East London, South Africa

Acceptance Rates

SAICSIT '13 Paper Acceptance Rate 48 of 89 submissions, 54%;

Overall Acceptance Rate 187 of 439 submissions, 43%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
520
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)1

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Qatish D(2023)Informedness and Effectiveness in Search: Heuristic Simplicity and Algorithm Complexity2023 IEEE 3rd International Maghreb Meeting of the Conference on Sciences and Techniques of Automatic Control and Computer Engineering (MI-STA)10.1109/MI-STA57575.2023.10169436(12-17)Online publication date: 21-May-2023
https://doi.org/10.1109/MI-STA57575.2023.10169436
Dirgová Luptáková IPospíchal J(2021)Transition Graph Analysis of Sliding Tile Puzzle HeuristicsRecent Advances in Soft Computing and Cybernetics10.1007/978-3-030-61659-5_13(149-156)Online publication date: 6-Feb-2021
https://doi.org/10.1007/978-3-030-61659-5_13
Liu CHuang SAkmal Khalid MIida H(2020)Attractiveness of Single-Agent Game: Case Study Using Sliding Puzzle2020 International Conference on Advanced Information Technologies (ICAIT)10.1109/ICAIT51105.2020.9261794(76-81)Online publication date: 4-Nov-2020
https://doi.org/10.1109/ICAIT51105.2020.9261794

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A genetic programming approach to the generation of hyper-heuristics for the uncapacitated examination timetabling problem

Solving the 0/1 knapsack problem using an adaptive genetic algorithm

A genetic programming approach for solving the linear ordering problem

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A genetic programming approach to the generation of hyper-heuristics for the uncapacitated examination timetabling problem

Solving the 0/1 knapsack problem using an adaptive genetic algorithm

A genetic programming approach for solving the linear ordering problem

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations