In this course, we will discover and implement three main artificial intelligence algorithms for finding paths in grids, graphs or trees.

We will implement:

• The depth-first-first algorithm (DFS)

• The breadth-first algorithm (BFS)

• The A* search algorithm

We will apply these different algorithms to a robotics problem, enabling a robot to find its path in a room. Beyond robotics, these algorithms are ubiquitous and we will implement them in a generic way, allowing you to apply them to other problems.

This course is taught using the Python programming language and requires basic programming skills. If you do not have the required knowledge, I recommend that you brush up on your programming skills by taking a crash course in programming. Although Python is used, we will implement the various algorithms from scratch, which will allow you to easily implement them in other programming languages.

This course is primarily aimed at students, researchers, and developers who would like to add artificial intelligence to their projects, as well as artificial intelligence enthusiasts.

Concepts covered:

• The depth-first-first algorithm (DFS) and its implementation

• The breadth-first algorithm (BFS) and its implementation

• The A* path search algorithm and its implementation

• Artificial intelligence in robotics and video games

• Tree traversal (depth and width)

• Graph traversal

Don't wait any longer before jumping into the world of artificial intelligence!