2 ms·
I was hoping this would be about how difficulty scales with piece count (I doubt it's linear), and what a practical limit for piece count would be in terms of t
by dehrmann 6y ago
I was hoping this would be about how difficulty scales with piece count (I doubt it's linear), and what a practical limit for piece count would be in terms of the time to solve it. If I had to guess, it would be n^2.
Anecdotally, my grandma finds 500 piece puzzles a lot harder than 300.
- jayd16 6y agoHmm, would it have to do with information density? If you had a puzzle that was a simple gradient, you could easily locate the region a piece belonged to despite the number of pieces. If the puzzle was blank, the difficulty would ramp up much quicker.
- madcaptenor 6y agoI wrote the original post. n^2 seems reasonable to me as well. If you have n pieces, you have to make O(n) connections to solve the puzzle. But to find the piece that makes each connection, you need to look through O(n) pieces. Multiplying gives O(n^2).