SEMALG 2024

From FUN2022:
- Pushing Blocks by Sweeping Lines
- A Practical Algorithm for Chess Unwinnability
- Pushing Blocks via Checkable Gadgets: PSPACE-Completeness 
  of Push-1F and Block/Box Dude 
- Chess Is Hard Even for a Single Player
- Quantum-Inspired Combinatorial Games: Algorithms and Complexity
- How Fast Can We Play Tetris Greedily with Rectangular Pieces?
- Wordle Is NP-Hard

From FUN2021:
- Taming the Knight's Tour: Minimizing Turns and Crossings
- 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 PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games
- Making Change in 2048
- The Complexity of Escaping Labyrinths and Enchanted Forests
- Computational Complexity of Generalized Push Fight

From FUN2016:
- 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
- Two Dots is NP-complete

From FUN2014:
- Playing Dominoes is Hard, Except by Yourself
- Quell
- No Easy Puzzles: A Hardness Result for Jigsaw Puzzles

From FUN2012:
- The Kissing Problem: How to End a Gathering When Everyone Kisses
  Everyone Else Goodbye
- The Vulcan Game of Kal-Toh: Finding
  or Making Triconnected Planar Subgraphs
- Solving Single-Digit Sudoku Subproblems

From FUN2010:
- Mapping an Unfriendly Subway System


Other papers from these FUN conferences may also be chosen!