P.I.HUNT 5/All Wo. Rk.

From Brainstorm
< P.I.HUNT 5
Revision as of 03:11, 10 August 2021 by imported>Cplover
Jump to navigation Jump to search
Click to load external content
Sourced from https://www.youtube.com/watch?v=UYmaOt22218


Spoiler warning: Solution follows
The first step of this puzzle is to determine the pattern of objects that lie underneath the two obscured 2x3 regions. These form braille letters that spell OPTIMAL ROUTE DIVERGES WHEN, and each level has a more optimal solution:
Level Image Solution paths (given, and optimal) Diverges at
1 File:P.I.HUNT 5 - All% Wo. Rk. (1).png
DRURU RDRRU RLDDR URRLD DRURR URUU (29 moves)
DRURU RDRRU RLDDR URRLD DRURR UUU (28 moves)
27 (A mod 26)
2 File:P.I.HUNT 5 - All% Wo. Rk. (2).png
DURDR ULLDD DDDDR RRRUD DLULD RRUUU DDDLL UUUUR RURUR RURRD RDRUL LULLD DRRUU LLDDD LURUL DDRRD DLD (83 moves)
DURDR ULLDD DDDRR UURLD DLDRR RUDDL UURUU URURR URRDR DRULL ULLDD RRUUL LDDDL URULD DRRDD LD (77 moves)
14 (N mod 26)
3 File:P.I.HUNT 5 - All% Wo. Rk. (3).png
LLDDR DDDRD RDRDL LULUR RDRDR RRULR RDLRR ULRUU LDURD DLLLL UUDDD RURDL LUUUU RDLLU LULLD DRDDD RRRUU UURDL LUUUU R (96 moves)
LLDDR DDDRD RDRDL LULUR RDRDR RRULR RDLRR ULRUU LDURU ULRDD DDLLL LUUDD DRURD LLUUU URURU ULL (78 moves)
45 (S mod 26)
4 File:P.I.HUNT 5 - All% Wo. Rk. (4).png
LDLLU LLLLR UULDR DLDLL ULL (23 moves)
LDLLU LLLUL DDRDL LDLLU U (21 moves)
9 (I mod 26)
5 File:P.I.HUNT 5 - All% Wo. Rk. (5).png
DDLUU RULUU UDDDR UULUU RUURR DDRDD LDDUR ULDLL URRDU RDDDL DRDRR ULLUU RRLDD RRRUU DDRUR DLLUU URRUU RR (91 moves)
DDLUU RULUU UDDDR UULUU RUURR DDRDD LDDUR ULDLU RRDDD DULDD RRRDR ULUUR DDRRU UUUUR R (71 moves)
40 (N mod 26)
6 File:P.I.HUNT 5 - All% Wo. Rk. (6).png
DRRLL LDDRR RUDLU DLLUR RUDRD RRUDL LURRD RRDRR DRLUL LUURR RDDUU ULDLL LLLLL DLUUL RRDLL ULL (78 moves)
DRRLL LDDRR RUDLU DLLUR RUDRD RRUDL LURRD RRDRR DRLUL LUURR RDDUU ULDLL LLLLL DLULR RLULL DL (77 moves)
69 (Q mod 26)
7 File:P.I.HUNT 5 - All% Wo. Rk. (7).png
LLDDR URDLD RUURD LDDRU UULUR DRDLU URUUR URRRD DUULD LURRD DDRDR RRULD DDLRU LLDL (69 moves)
LLDDR URDLD RUURD LDDRU UULUR DRDLU URUUR URRRD DUULD LLURR RDDDR DRRDD DRULL DL (67 moves)
47 (U mod 26)
8 File:P.I.HUNT 5 - All% Wo. Rk. (8).png
LLDDD DRRDR ULURD RURDL DRURD LDRDL DRRRR DRUUL UURLD DRUUR ULDLL UUULU (60 moves)
LLDDD DRRUR DLDRU RRDUL LDRRU RRDLD RRRRD RUULU URLDD RUURU LDLLU UULU (59 moves)

Note: LLDDD DRRDR ULURD RURDL DDRUR RDLDR RRRDR UULUU RLDDR UURUL DLLUU ULU (58 moves) appears to be even more optimal
9 (I mod 26)
9 File:P.I.HUNT 5 - All% Wo. Rk. (9).png
UUURR RRDDL DRDLD RUURR DUULD RDRDL UURLL URRDR RURRD LDULD DDRUU URRDD DULLR RULLD DDDDR RDLUR DRURR (85 moves)
??? 
? (R mod 26)
10 File:P.I.HUNT 5 - All% Wo. Rk. (01).png
LLULU LDRRR ULURD DDDLL ULUUU LURRD DDDLL ULUUL URRRD DRR (48 moves)
LLULU LDRUL URDDD DLLUL ULURR DDDDL LULUL URRRD DRR (43 moves)
9 (I mod 26)
11 File:P.I.HUNT 5 - All% Wo. Rk. (11).png
URDDD LURRL DRULU RRRRR RRRRR DRUUL UUUDR RDLUU RDLUU RDDUL DDRD (54 moves)
URDDD LURRL DRULU RRRRR RRRRR DRUUL UUUDR RDLUR DUULD RD (47 moves)
40 (N mod 26)
12 File:P.I.HUNT 5 - All% Wo. Rk. (12).png
URUUR ULLRR RDRDR DRRRR RRRRR RRRRR RRRRR RRRRR RRRRR RRRRR DD (52 moves)
URUUR UULLD RRRRR RRRDR DDRRR RRRDD (30 moves)
7 (G mod 26)
Reading the step (mod 26) at which this optimal path diverges from the given path spells ANS INQUIRING alphanumerically.