Key words
Objectives
To gain insight in solution methods for complex problems, graphs, computatorial geometry, search and game strategies.
Prerequisites
Topics
A survey of the classical graph algorithms : depth and breadth first search, minimal spanning tree, minimal distances, acyclic graphs and topological sorting, flow networks and matching.
Introduction to computatorial geometry: basic techniques, convex hull, proximity, point location, geometric search, line segment intersection.
Introduction to search and game strategies, backtracking, brauch-and-bound, munimax, a-b pruning.
Teaching Methods
Materials used
Study guidance
Assessment
Study costs
Lecturer(s)
Rudy STOOP
Language
Dutch
|
|
