This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
teaching:mfe:ia [2015/04/11 17:45] stuetzle [Automatic fine-tuning of an evolutionary multi-objective framework] |
teaching:mfe:ia [2015/04/11 17:47] stuetzle [Stochastic Local Search heuristics for solving NP-complete puzzles.] |
||
|---|---|---|---|
| Line 213: | Line 213: | ||
| * [[http://iridia.ulb.ac.be/~lperez|Leslie Perez (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~lperez|Leslie Perez (IRIDIA)]] | ||
| - | |||
| - | |||
| - | ===== Stochastic Local Search heuristics for solving NP-complete puzzles. ====== | ||
| - | |||
| - | This project is about single player games (puzzles) and the design of algorithms for tackling hard combinatorial optimisation problems. | ||
| - | Example puzzles are: [[http://en.wikipedia.org/wiki/Light_Up|Light Up]], [[http://en.wikipedia.org/wiki/Mastermind_(board_game)|Mastermind]], [[http://en.wikipedia.org/wiki/Minesweeper_(video_game)|Minesweeper]], etc. | ||
| - | |||
| - | The student will learn how to design and implement a Stochastic Local Search algorithm to solve NP-complete puzzles. The student will also learn how to analyse the performaces of the algorithm and perform statistically sound comparisons with the other algorithms available in literature. | ||
| - | |||
| - | Required skills: good knowledge of C or C++ programming. | ||
| - | |||
| - | |||
| - | * Contacts : | ||
| - | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]] | ||
| - | * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]] | ||