Papers for SEMALG Spring 2022
Hendrik Jan Hoogeboom & Walter Kosters, 24.12.2021
***other papers form these three proceedings may also be chosen!***
From FUN2021:
- Taming the Knight's Tour: Minimizing Turns and Crossings
- Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots
- 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete
- Efficient Algorithms for Battleship
- An Open Pouring Problem
- The Computational Complexity of Evil Hangman
From FUN2018:
- How Bad is the Freedom to Flood-It?
- On the Complexity of Two Dots for Narrow Boards and Few Colors
- On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games
- Making Change in 2048
- The Complexity of Speedrunning Video Games
- The Complexity of Escaping Labyrinths and Enchanted Forests
From FUN2016:
- 2048 Without New Tiles Is Still Hard
- Trainyard is NP-hard
- Hanabi is NP-complete, Even for Cheaters who Look at Their Cards
- Spy-Game on Graphs
- The Complexity of Snake
- Building a Better Mouse Maze
- Threes!, Fives, 1024!, and 2048 are Hard
- Two Dots is NP-complete
Weblinks:
FUN2021
10th International Conference on Fun with Algorithms
link
another link
FUN2018
9th International Conference on Fun with Algorithms
link
another link
FUN2016:
8th International Conference on Fun with Algorithms
link
another link