Skip to main content

Ctrl+K

TAB2025

NP-Hardness and Graph Matching

1. NP-Complete Problems
2. Simulated and Deterministic Annealing

Puzzles and Rubik

3. Heuristic Search

Game Searching

4. Game Search

Practice 1

5. Introduction to the practical part of TAB2025
6. Graph Construction for Matching
7. Graph Matching
8. Graph Matching with Topological Features

Practice 2

9. Clustering

Practice 3

10. Pacman with AI
11. Game Theory and Adversarial Search
12. Alpha-Beta Pruning

Exam solutions

13. Assignment 06/25

Repository
Open issue

Search

Ctrl+K

By Francisco Javier Escolano Ruiz

© Copyright 2022.