You are probably here because you want a list of games (board games and video games) by their computational complexity.
I used to maintain a list like that. It's in the intersection of my interests. However, it was not comprehensive at all, I added things only when I felt I wanted to. And that made it not very useful as a resource. The last update to this list was in 2018 or so.
If you want lists, Wikipedia has several lists of hard problems, such as NP-complete games and puzzles. I also like the Fun with Algorithms series of conferences, which are about serious algorithm theory applied to recreational fun topics. Those are good sources to look at.
I don't think this page is actually linked from anywhere that I know of, but I'll just leave it up as posterity.
This page is no longer being maintained. Everything below is provided as-is. There might be styling errors, rotted links, and so on.
I love puzzles and games a lot. I also enjoy theoretical computer science. So, of course this had to be done.
This page documents as many possible puzzles/games/etc and their computational complexity, along with sources leading to them. I strive to make this as complete as possible, but it's obviously very hard, so you're welcome to help; you can contact me through my e-mail, available on the main page.
Note: There is a difference between satisfiability/consistency problems and uniqueness/soundness problems. For certain games/puzzles, there are two questions that make sense: whether a given instance of a puzzle has at least one solution (it is satisfiable/consistent), and whether it has at most one solution (it is sound). We can generalize the soundness problem: given an instance of a partially-solved puzzle, whether there exists "anything" that can be deduced (the contents of a cell, etc). Most works only talk about whether something is satisfiable, but whether something is sound is also important: most logic puzzles should only have one solution (it's in the name, the solution should be deducible through logic and not guessing); if you have multiple solutions in Minesweeper, you need to resort to guessing and thus might lose just due to chance, etc. I try my best to document this distinction below.