A list of all the patterns I've discovered, as well as what they do.
Nehmetawy's Gambit (list, list → list)
Similar to Thoth's Gambit, but won't copy the original stack inside each sub-execution.
Conway's Gambit (list, list → list)
Similar to Thoth's Gambit; for data list with length n, it executes n - 1 times; The first initial stack is the first two elements, and each subsequent execution uses the stack after the last execution.
Rubik's Gambit (list, vec, vec(, int) → list)
Executes given list on each point as initial iota inside the cuboid defined by given 2 points as body diagonal.
Optional number (valid range: 0 - 3) stands for their iteration order: 0 (by default) for no sorting, 1 for nearest first, 2 for farthest first, and 3 for randomly shuffled.
Measuring Ruler's Gambit (list, vec, vec(, int(, int)) → list)
Executes given list on each point as initial iota on the line connecting 2 points (start, end).
First optional number (2 by default, valid range: 0 - 7) is used for bitwise option (1 = include start point, 2 = include end point, 4 = attach each point to nearest block center), and second one (a positive integer) for manually assign the number of segments to split (otherwise points are adjacent by-block).
Ultimine's Gambit (list, vec(, int(, int)) → list)
Executes given list on each point as initial iota which is connected with given points with the same block type, and within casting ambit.
First optional number (1 by default, valid range: 1 - 7) is used for configuring spreading ways bitwise (1 = 6 faces, 2 = 12 edges, 4 = 8 corners), and second one (a positive integer) for limiting max chain positions count.
Pure Rubik's Gambit (list, vec, vec(, int) → list)
...and yes, there are pure version for those shaped mapping patterns, too.
Everything the same, except that original stack isn't copied into each sub-executions.
Pure Ruler's Gambit (list, vec, vec(, int(, int)) → list)
Everything the same, except that original stack isn't copied into each sub-executions.
Pure Ultimine's Gambit (list, vec(, int(, int)) → list)
Everything the same, except that original stack isn't copied into each sub-executions.
Build Nested (list, num → list)
Copy list #0 and set back to index #1
Transplant's Exaltation (list, list, any → list)
List iota #0 is the nested list to be modified. According to the index sequence given by list #1, traverses to the inner layer, and sets the corresponding element to iota #2.
Noob Num Reflection (→ number)
The starting cumulative number is 0; putting the initial direction to →, all ↗ makes the result * 2 + 1, all → makes it * 2, and all ↘ for / 10. Starting with the patterns on the right negates the result.
Mass Rotation Gambit (many, num, list → many)
Accepts the size to reorder and a bottom-to-top order list, and do the corresponding reorder to the rest of the stack. For example, 3 plus [1,2,0] for Rotation Gambit, and 2 plus [0,1,0,1] for Dioscuri Gambit
Contemplation
Same as Consideration, but with lowest execution priority, and won't grow in 2^n formula exponentially inside nested Intro-Retros
Elec. Fisherman's Gambit (→ many)
Each "n" on the fisherman pattern's bottom fishing line makes a copy of correspond iota to stack top, following the same targeting rules as Bookkeeper's Gambit.
Hanoi's Gambit (executable(, int) → many)
Executes given pattern/list/Jump? iota in an independent stack, then recovers the original stack at bottom. If given an integer argument X no more than stack size, first X iotas will be taken away as the initial new stack.
Patterns
HexFlow "Thoth"s
HexFlow Patterns