this post was submitted on 28 Jan 2026
21 points (88.9% liked)

Gaming

34229 readers
149 users here now

From video gaming to card games and stuff in between, if it's gaming you can probably discuss it here!

Please Note: Gaming memes are permitted to be posted on Meme Mondays, but will otherwise be removed in an effort to allow other discussions to take place.

See also Gaming's sister community Tabletop Gaming.


This community's icon was made by Aaron Schneider, under the CC-BY-NC-SA 4.0 license.

founded 4 years ago
MODERATORS
top 5 comments
sorted by: hot top controversial new old
[–] 5PACEBAR@piefed.ca 7 points 2 weeks ago* (last edited 2 weeks ago) (1 children)

I remember playing The Witness when it came out. Though it got a bit too difficult for me at some point, I remember the beautiful and serine environment, the feeling of discovery and achievement. I had a blast. A decade later, maybe it's time for me to get back.

[–] Megaman_EXE@beehaw.org 3 points 2 weeks ago (1 children)

Yeah I liked it! I felt like I was too dumb for some of the puzzles lol.

[–] AbelianGrape@beehaw.org 3 points 2 weeks ago (1 children)

People underestimate how hard the puzzles are. In computational complexity terms, the hardest puzzles in the witness are harder than sudoku.

[–] knokelmaat@beehaw.org 2 points 2 weeks ago (1 children)

Doesn't that depend on the sudoku though?

Or do you mean that there were puzzles that were harder to solve than even the hardest sudokus in the world?

[–] AbelianGrape@beehaw.org 3 points 2 weeks ago* (last edited 2 weeks ago)

In terms of "computational complexity" we mean the following:

Consider the following generalization of Sudoku. There is a number, N, and a grid of squares with N^2^ squares per side. (So the grid in total has N^4^ squares.) Each row and column of the grid has N^2^ squares. The grid therefore contains an N^2^ number of NxN subgrids (this corresponds to the 3x3 boxes in regular sudoku, called Houses). The puzzle is to fill each row, column, and house with the numbers from 1 to N^2^ with no duplicates.

The complexity is then a measure of how much harder the puzzles get when N is increased. Sudoku is a classic example of a so-called "NP-Hard" problem. Most puzzles that people think of as difficult are NP-hard. The ELI5 is that given a claimed solution to a sudoku puzzle, you can check if it really is the solution quickly (where again "quickly" is in terms of N). This is not true for the hardest types of puzzles in the witness.

This is only a proxy for how difficult humans will find the smaller puzzles but it's remarkably accurate. The hardest puzzles using every mechanic from the witness (realistically, only using two of them including the last one) are going to be much harder for a human than the hardest sudokus.