Why Stephen’s Sausage Roll is Brutal: A State-Space Walkthrough of the Opening Levels скачать в хорошем качестве

Why Stephen’s Sausage Roll is Brutal: A State-Space Walkthrough of the Opening Levels

I have re-implemented the mechanics of the game Stephen's Sausage Roll in c++ with OpenGL. Here we look at two of the levels "South Jaunt" and "Infant's Break" (two of the first levels). We give the optimal solution to both, and have a look at the associated state spaces. Stephen's Sausage Roll is one of the hardest puzzle games of all time, so it provides many great problems for the purposes of puzzle analysis. #puzzle #mathematics #sokoban Discord:   / discord   Timestamps: 00:00 Introduction to Stephen's Sausage Roll 00:26 My reimplementation of the game 00:37 State Graph of South Jaunt 00:59 Optimal Solution for South Jaunt 01:21 Optimal Solution played out in the actual game 01:50 Pruning South Jaunt states that are lost 02:19 Reduction to redeemable states 02:44 Different graph layout for South Jaunt 02:58 Explanation of what force directed layout means 03:11 Looking at state spaces in general 04:06 If there are holes or hot plates, we lose four nodes, and various edges 04:41 Loss of orientations when near a wall segment 05:20 Claustrophobic feeling when walking down 'corridors' with the fork 06:01 Second level, Infant's break 06:12 Optimal solution for Infant's break 06:32 Bridge node that you must factor through in solving the puzzle 07:20 Strange Necklace of states in different layout