Skip to content
UdemyArtificial IntelligencePaid courseAll LevelsCertificate

Artificial Intelligence I: Meta-Heuristics and Games in Java (Udemy.com)

Graph Algorithms, Genetic Algorithms, Simulated Annealing, Swarm Intelligence, Minimax, Heuristics and Meta-Heuristics

Created by: Holczer Balazs

Last updated September 2026

icon
What you will learn

  • Get a good grasp of artificial intelligence
  • Understand how AI algorithms work
  • Understand graph search algorithms - BFS, DFS and A* search
  • Understand meta-heuristics
  • Understand genetic algorithms
  • Understand simulated annealing
  • Understand swarm intelligence and particle swarm optimization
  • Understand game trees
  • Understand minimax algorithm and alpha-beta pruning
  • Tic Tac Toe game from scratch with minimax algorithm

How it compares

Against the other 205 rated Udemy courses in Artificial Intelligence on CourseDuck:

  • Rating4.5 out of 5higher than 58% of them
  • Reviews848#81 of 206 by number of reviews
  • Length9.2 hourslonger than 69% of them
  • Last updatedSeptember 2026more recently than 99% of them

icon
Quality Score

Content Quality
/
Video Quality
/
Qualified Instructor
/
Course Pace
/
Course Depth & Coverage
/

Overall Score : 90 / 100

icon
Course Description

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.

- PATHFINDING ALGORITHMS -

Section 1 - Breadth-First Search (BFS)

  • what is breadth-first search algorithm

  • why to use graph algorithms in AI

Section 2 - Depth-First Search (DFS)

  • what is depth-first search algorithm

  • implementation with iteration and with recursion

  • depth-first search stack memory visualization

  • maze escape application

Section 3 - Iterative Deepening Depth-First Search (IDDFS)

  • what is iterative deepening depth-first search algorithm

Section 4 - A* Search Algorithm

  • what is A* search algorithm

  • what is the difference between Dijkstra's algorithm and A* search

  • what is a heuristic

  • Manhattan distance and Euclidean distance

- OPTIMIZATION -

Section 5 - Optimization Approaches

  • basic optimization algorithms

  • brute-force search

  • hill climbing algorithm

- META-HEURISTICS -

Section 6 - Simulated Annealing

  • what is simulated annealing

  • how to find the extremum of functions

  • how to solve combinatorial optimization problems

  • travelling salesman problem (TSP)

Section 7 - Genetic Algorithms

  • what are genetic algorithms

  • artificial evolution and natural selection

  • crossover and mutation

  • solving the knapsack problem

Section 8 - Particle Swarm Optimization (PSO)

  • what is swarm intelligence

  • what is the Particle Swarm Optimization algorithm

- GAMES AND GAME TREES -

Section 9 - Game Trees

  • what are game trees

  • how to construct game trees

Section 10 - Minimax Algorithm and Game Engines

  • what is the minimax algorithm

  • what is the problem with game trees?

  • using the alpha-beta pruning approach

  • chess problem

Section 11 - Tic Tac Toe with Minimax

  • Tic Tac Toe game and its implementation

  • using minimax algorithm

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!

icon
Udemy Discount

The discount is applied through our link. Open the course from here and Udemy's current promotional price is applied at checkout on most courses, no code to type.

Some courses are excluded from Udemy's promotions. If the price does not drop, clear your browser cookies and use the button again.

icon
Instructor Details

Holczer Balazs

My name is Balazs Holczer. I am from Budapest, Hungary. I am qualified as a physicist. At the moment I am working as a simulation engineer at a multinational company. I have been interested in algorithms and data structures and its implementations especially in Java since university. Later on I got acquainted with machine learning techniques, artificial intelligence, numerical methods and recipes such as solving differential equations, linear algebra, interpolation and extrapolation. These things may prove to be very very important in several fields: software engineering, research and development or investment banking. I have a special addiction to quantitative models such as the Black-Scholes model, or the Merton-model.

Take a look at my website if you are interested in these topics!

icon
More courses by Holczer Balazs

$16.99

$10.99

$11.99

$10.99

$13.99

$13.99

icon
More Artificial Intelligence courses

Free

Free

Free

$79.99

Free

icon
Reviews

4.5

848 ratings on Udemy

Select a bar to show only those reviews.Select the bar again to show every rating.

By Jack Hendron on 6/17/2022

The instructor is really knowledgeable, and you can tell he knows his stuff. He makes the algorithms really simple to understand by covering the theory in depth then implementing them in code referencing back to the theory so you can relate the theorical to the concrete. The algos learned can help in many problem-solving tasks involving code, not just ML/AI, and I recommend any coders looking to up their math-related coding skills take this course.

By Leonardo Angeli on 12/10/2020

The course was great on the algorithms part. It really explained you both theoretically and visually with great tools and examples what is happening when you run a given algo. The only problem I found, there aren't really a lot of language conventions used. Some pieces of code may have been refractored differently. But again, if you already know Java and can do it by your self this is really good course

By Roberto Ambrosio on 3/21/2020

Very good course for an introductory overview of some basic artificial intelligence concepts and algorithms (especially if you have some Java back-ground). I've see a lot of people comment about the presenters accent and yes, it is a bit hard to follow at first, but you get use to it quickly enough and I did not find it detracted from his ability to explain an convey the concepts.

By Steven Pike on 7/28/2019

The instructor has a unique style and has a non-native English accent (Hungarian) and certain idiosyncrasies. Once you get used to his pattern, you realize he packs a lot of information in the most efficient way possible. I've gone over a lesson multiple times, and learned something new, or a new highlighted point. Extraordinary value and I would say one of the best tutorial series on Udemy for AI learning. I have tried other instructors in this field, but this instructor is the best to date, in my opinion, for my learning style.

By Jose Lopez on 2/8/2019

Great introductory course for classic artificial intelligence! Very concise and to the point. Good example implementations. Thank you! My only other comment would be that, on the Minimax section, I would have preferred the Tic-Tac-Toe example to start with the actual implementation of the Minimax algorithm, instead of the Tic-Tac-Toe components, since it made it harder for me to understand the Minimax implementation outside of Tic-Tac-Toe.

By Duane May on 12/16/2018

I have seen other AI courses that were too theoretical and others that just show you how to use a third-party library that implements the algorithms. Holczer has a good balance of theory and application of the concepts. I like the simple examples that are used and coded with no outside libraries, meaning you can apply it anywhere. I watch the lectures in 1.75x speed and pause the video occasionally during coding as I write my own. One suggestion for improvement would be the coding itself could be cleaner, seems to be older style Java. But I code it my way as I follow along. Thanks for reading! :)

By F. Andy Seidl on 4/28/2018

Generally, the course was quite clear and concise. The exception was the tic-tac-toe implementation, which became clear, eventually, but which could benefit from a discussion, early on, about the data structures being used. For example, why is the board a 2d array when each cell indicates its own coordinates? Another example: there was no explanation of making/unmaking moves as the minmax method explored the game tree. (Making the moves is accomplished by a move() method, but unmaking is accomplished by directly editing the board array. This process could be made more uniform--and thus, more clear.)

By Caspar Thomas on 6/20/2017

This is a good course covering the basic background concepts of AI in Java. The theory is well presented and example code is provided to demonstrate implementations of the concepts. The only thing I would have liked to see, is more structured exercises and problems for the student to solve on their own to reinforce the concepts taught. I did attempt to implement most of the concepts in code before going through the implementation lectures - but I think it might be easy to be tempted to just follow the course through without trying to implement the code for yourself. On the whole though - I very much enjoyed the course and found the content very interesting.

By Alfred Loh on 3/14/2017

I must say this is a very great course. Easy for me as a fresh man in AI. It is a basic course and open the door to some basic algorithm of AI. I love the implementation portion, which I can hands on for what was described in the theory.

By Milenko Maletic on 10/21/2016

Although course is not polished and lacks jaw dropping AV quality, advanced topics are explained with simplicity. With this course I build solid ground for jumping to much more complicated stuff, such as neural networks and machine learning. Thanks mr Holczer.

By Matthew

I found the topics did not provide enough detail, and what was provided was slow and dry.

The video examples are not all provided in the example code. An example of this, as of 21/08/18 the A Star video code is completely difference to the source code. In addition the source code is broken and not implemented correctly.

By John Chapman

easy paced and concepts described well

Showing 12 of 54 reviews