You're reading from Artificial Intelligence with Python Your complete guide to building intelligent apps using Python 3.x

Product type Paperback

Published in Jan 2020

Publisher Packt

ISBN-13 9781839219535

Length 618 pages

Edition 2nd Edition

Languages

Python

Tools

TensorFlow

Concepts

Artificial Intelligence

Authors (2):

Prateek Joshi

Alberto Artasanchez

View More author details

Table of Contents (26) Chapters

Preface

1. Introduction to Artificial Intelligence

2. Fundamental Use Cases for Artificial Intelligence FREE CHAPTER

3. Machine Learning Pipelines

4. Feature Selection and Feature Engineering

5. Classification and Regression Using Supervised Learning

6. Predictive Analytics with Ensemble Learning

7. Detecting Patterns with Unsupervised Learning

8. Building Recommender Systems

9. Logic Programming

10. Heuristic Search Techniques

11. Genetic Algorithms and Genetic Programming

12. Artificial Intelligence on the Cloud

13. Building Games with Artificial Intelligence

14. Building a Speech Recognizer

15. Natural Language Processing

16. Chatbots

17. Sequential Data and Time Series Analysis

18. Image Recognition

19. Neural Networks

20. Deep Learning with Convolutional Neural Networks

21. Recurrent Neural Networks and Other Deep Learning Models

22. Creating Intelligent Agents with Reinforcement Learning

23. Artificial Intelligence and Big Data

24. Other Books You May Enjoy

25. Index

Building an 8-puzzle solver

The 8-puzzle is a variant of the 15-puzzle. You can check it out at https://en.wikipedia.org/wiki/15_puzzle. You will be presented with a randomized grid and your goal is to get it back to the original ordered configuration. You can play the game to get familiar with it at http://mypuzzle.org/sliding.

We will use an A* algorithm to solve this problem. It is an algorithm that's used to find paths to the solution in a graph. This algorithm is a combination of Dijkstra's algorithm and a greedy best-first search. Instead of blindly guessing where to go next, the A* algorithm picks the one that looks the most promising. At each node, the list of all possibilities is generated and then the one with the minimal cost required to reach the goal is picked.

Let's see how to define the cost function. At each node, the cost needs to be computed. This cost is basically the sum of two costs – the first cost is the cost of getting to the...