Artificial Intelligence I: Meta-Heuristics and Games in Java
What you’ll learn
Get a good grasp of artificial intelligence
Understand how AI algorithms work
Able to create AI algorithms on your own from scratch
Tic Tac Toe game from scratch
This course is about the fundamental concepts of artificial intelligence. This topic is getting very hot nowadays because these learning algorithms can be used in several fields from software engineering to investment banking. Learning algorithms can recognize patterns which can help detecting cancer for example. We may construct algorithms that can have a very good guess about stock price movement in the market.
path findinf algorithms
graph traversal (BFS and DFS)
enhanced search algorihtms
A* search algorithm
basic optimization algorithms
stochastic search and hill climbing algorithm
heuristics and meta-heuristics
particle swarm optimization
applications of game trees in chess
Tic Tac Toe game and its implementation
In the first chapter we are going to talk about the basic graph algorithms. Several advanced algorithms can be solved with the help of graphs, so as far as I am concerned these algorithms are the first steps.
Second chapter is about local search: finding minimum and maximum or global optimum in the main. These searches are used frequently when we use regression for example and want to find the parameters for the fit. We will consider basic concepts as well as the more advanced algorithms: heuristics and meta-heuristics.
The last topic will be about minimax algorithm and how to use this technique in games such as chess or tic-tac-toe, how to build and construct a game tree, how to analyze these kinds of tree like structures and so on. We will implement the tic-tac-toe game together in the end.
Thanks for joining the course, let’s get started!
Who this course is for:
- This course is meant for students or anyone who interested in programming and have some background in basic Java
- Why Should You Learn Artificial Intelligence?
- PATHFINDING ALGORITHMS (GRAPHS)
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Iterative Deepening Depth-First Search (IDDFS)
- A* Search Algorithm
- META-HEURISTICS AND OPTIMIZATION
- Tabu Search