“…An example of this usage and it's advantage is as follows. For case (s, d, n, h) = (3, 2, 26, 0) the exhaustive complete element ordered search required 9 minutes and 41 seconds, a total of 751, 909, 026 moves traversing up/down the search space tree, to reach the first solution of: (27,25,23,26,24,8,6,17,3,11,12,3,6,8,3,21,14,22,6,13,11,8,12,20,17,23,25,27,24,26,14,11,13,16,12,18,21,19,4,22,10,17,4,20,14,13,4,15,23,16,…”