coolcomputery
Regular
5x5 NRG is at most 20 (empty -> AEUY) + 43 ( + BCD VWX M) + 65 ( + FG KL PQ) + 91 ( + rest of board) = 219
code + results: https://gist.github.com/coolcomputery/0a439b46ee0758310530b9b6a4cf60c8
(builds off of the code I used in my recent post on regular Loopover)
I changed the solving phases so that the last phase does the row-center column-right 3x3 instead of the central 3x3.
I also included more NRG sequences: specifically, conjugations Z*S*Z^{-1}, where cost(Z)<=14 and S is one of the following:
Ideally I would generate conjugations in a smarter way (a Dijkstra-like approach) instead of brute-forcing all Z, like I have in my previous post, but I haven't had the time yet to implement it in C++. There are probably many other significant improvements that can be made...
code + results: https://gist.github.com/coolcomputery/0a439b46ee0758310530b9b6a4cf60c8
(builds off of the code I used in my recent post on regular Loopover)
I changed the solving phases so that the last phase does the row-center column-right 3x3 instead of the central 3x3.
I also included more NRG sequences: specifically, conjugations Z*S*Z^{-1}, where cost(Z)<=14 and S is one of the following:
- a subset of some small-cycle algorithms I found a few years ago
- a commutator A*B*A^{-1}*B^{-1} of cost <=16, where both A and B are "loops" (the gripped piece starts and ends at the same place)
Ideally I would generate conjugations in a smarter way (a Dijkstra-like approach) instead of brute-forcing all Z, like I have in my previous post, but I haven't had the time yet to implement it in C++. There are probably many other significant improvements that can be made...