A survey of NP-complete puzzles
Single-player games (often called puzzles) have received considerable attention from the
scientific community. Consequently, interesting insights into some puzzles, and into the …
scientific community. Consequently, interesting insights into some puzzles, and into the …
Computational complexity of two-dimensional platform games
M Forišek - Fun with Algorithms: 5th International Conference, FUN …, 2010 - Springer
We analyze the computational complexity of various two-dimensional platform games. We
state and prove several meta-theorems that identify a class of these games for which the set …
state and prove several meta-theorems that identify a class of these games for which the set …
[HTML][HTML] Lemmings is PSPACE-complete
G Viglietta - Theoretical Computer Science, 2015 - Elsevier
Lemmings is a computer puzzle game developed by DMA Design and published by
Psygnosis in 1991, in which the player has to guide a tribe of lemming creatures to safety …
Psygnosis in 1991, in which the player has to guide a tribe of lemming creatures to safety …
Permission impossible: Teaching firewall configuration in a game environment
S Sehl, K Vaniea - 3rd European Workshop on Usable Security, 2018 - research.ed.ac.uk
Abstract Topics in Computer Security, such as firewalls, can seem inaccessible or very
difficult to beginners. That perceived inaccessibility is a serious problem at a time when …
difficult to beginners. That perceived inaccessibility is a serious problem at a time when …
[PDF][PDF] Evaluation functions for playing videogames automatically
M Rodriguez - 2021 - academia.edu
Most robot control problems are np-hard as default. To solve them on a microcomputer the
state apace can be reduced with subgoals. In addition, a cost function guides the search in …
state apace can be reduced with subgoals. In addition, a cost function guides the search in …