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 [2011/03/23 16:51] mdorigo 1 project added |
teaching:mfe:ia [2011/03/23 16:54] mdorigo [Stochastic Local Search heuristics for solving NP-complete puzzles.] |
||
|---|---|---|---|
| Line 182: | Line 182: | ||
| This project is about single player games (puzzles) and the design of algorithms for tackling hard combinatorial optimisation problems. | This project is about single player games (puzzles) and the design of algorithms for tackling hard combinatorial optimisation problems. | ||
| - | Example puzzles are: <a href="http://en.wikipedia.org/wiki/Light_Up">Light Up</a>, <a href="http://en.wikipedia.org/wiki/Mastermind_(board_game)">Mastermind</a>, <a href="http://en.wikipedia.org/wiki/Minesweeper_(video_game)">Minesweeper</a>, etc. | + | 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. | 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. | ||