Papyrus' challenge: P Class (Solved by Dynamic Programming under polynomial time)

Levels: NP-complete (Reduced from Nonograms)

Levels: NP-complete for levels with n*n size (Reduced from restricted version of Hamilton Circuit. We put small spiders on every empty cells and force Fidel to kill them all to level up so it can win)

Levels: NP-hard (Reduced from the 3-SAT problem using keys, chests and boxes with green flame, similar to the NP-hard proof of Super Mario)

Levels: P Class (Solved by Euler Circuit under polynomial time)

In-game jigsaw puzzle: P Class (Enumerating diagonal states to reveal the answer, solved in linear time)

Levels: Basically in P Class (Solved by Topological Sorting in linear time)

Levels: NP-complete (Reduced from restricted version of Hamilton Circuit)

Puzzles: PSPACE-complete (Reduced from Sokoban)

Levels: NP-Hard (Reduced from Satisfiability Problem using only boxes, doors and buttons)