Introduction
  • Introduction
Why Should You Learn Artificial Intelligence?
  • What is AI good for?
PATHFINDING ALGORITHMS (GRAPHS)
  • Why to consider graph algorithms?
Breadth-First Search (BFS)
  • Breadth-first search introduction
  • Breadth-first search implementation
  • BFS Quiz
Depth-First Search (DFS)
  • Depth-first search introduction
  • Depth-first search implementation I - with stack
  • Depth-first search implementation II - with recursion
  • Depth-first search and stack memory visualisation
  • DFS Quiz
Course Challenge #1 - Maze Escape
  • Maze problem introduction
  • Course challenge #1 - maze problem
  • Maze problem implementation
Iterative Deepening Depth-First Search (IDDFS)
  • Enhanced search algorithms introduction (IDDFS)
  • Iterative deepening depth-first search (IDDFS) implementation
  • Enhanced Search Quiz
A* Search Algorithm
  • A* search introduction
  • A* search illustration
  • A* search implementation I
  • A* search implementation II
  • A* search implementation III
  • Path finding algorithms comparison
  • A* Search Quiz
OPTIMIZATION
  • Brute-force method
  • Brute-force method implementation
  • Hill climbing method
  • Hill climbing method implementation
  • Optimization Quiz
META-HEURISTICS AND OPTIMIZATION
  • Heuristics and meta-heuristics
  • Heuristics Quiz
Tabu Search
  • Tabu search introduction - basics
  • Tabu search introduction - tabu tenure
  • Tabu search illustration
  • Tabu search implementation I
  • Tabu search implementation II
  • Tabu Search Quiz
Simulated Annealing
  • What is simulated annealing?
  • Simulated annealing - function extremum I
  • Simulated annealing - function extremum II
  • Simulated annealing - function extremum III
  • What is the travelling salesman problem?
  • Travelling salesman problem I - city
  • Travelling salesman problem II - tour
  • Travelling salesman problem III - annealing algorithm
  • Travelling salesman problem IV - testing
  • Simulated Annealing Quiz
Genetic Algorithms
  • Genetic algorithms introduction - basics
  • Genetic algorithms introduction - chromosomes
  • Genetic algorithms introduction - crossover
  • Genetic algorithms introduction - mutation
  • Genetic algorithms introduction - the algorithm
  • Genetic algorithm implementation I - individual
  • Genetic algorithm implementation II - population
  • Genetic algorithm implementation III - the algorithm
  • Genetic algorithm implementation IV - testing
  • Genetic algorithm implementation V - function optimum
  • Genetic Algorithms Quiz
Course Challenge #2 - Knapsack Problem
  • Knapsack problem introduction
  • Course challenge #2 - knapsack problem
  • Knapsack problem with genetic algorithms
Particle Swarm Optimization
  • What is swarm intelligence?
  • Particle swarm optimization introduction I - basics
  • Particle swarm optimization introduction II - the algorithm
  • Particle swarm optimization implementation I - particle
  • Particle swarm optimization implementation II - initialize
  • Particle swarm optimization implementation III - the algorithm
  • Particle swarm optimization implementation IV - testing
  • Particle Swarm Optimization Quiz
TWO PLAYER GAMES
  • Game trees introduction
  • Two Player Games Quiz
Minimax Algorithm - Game Engines
  • Minimax algorithm introduction - basics
  • Minimax algorithm introduction - the algorithm
  • Minimax algorithm introduction - relation to tic-tac-toe
  • Alpha-beta pruning introduction
  • Alpha-beta pruning example
  • Chess problem
  • Game Engines Quiz
Tic-Tac-Toe Game
  • About the game
  • Cell
  • Constants and Player
  • Game implementation I