Table 4 Variety of equally possible ways to execute an optimal solution.
Tactic | Sequence of key elements | Possible route corresponding to algorithmic structure | Number of equally possible routes to implement the solution |
|---|---|---|---|
Optimal | Entrance-Coin+-Coin+-Exit | En-O-Q-H-Coin1+-H-G-Coin2+-Z-U-T-Ex2 En-O-Q-H-Coin1+-K-I-M-B-Coin2+-Z-U-T-Ex2 En-O-Q-H-Coin1+-K-I-Q-G-Coin2+-Z-U-T-Ex2 En-O-Q-H-Coin1+-H-G-Coin2+-B-N-P-Ex2 En-O-Q-H-Coin1+-K-I-M-B-Coin2+-B-N-P-Ex2 En-O-Q-H-Coin1+-K-I-Q-G-Coin2+-B-N-P-Ex2 En-O-I-K-Coin1+-H-G-Coin2+-Z-U-T-Ex2 En-O-I-K-Coin1+-K-I-M-B-Coin2+-Z-U-T-Ex2 En-O-I-K-Coin1+-K-I-Q-G-Coin2+-Z-U-T-Ex2 En-O-I-K-Coin1+-H-G-Coin2+-B-N-P-Ex2 En-O-I-K-Coin1+-K-I-M-B-Coin2+-B-N-P-Ex2 En-O-I-K-Coin1+-K-I-Q-G-Coin2+-B-N-P-Ex2 En-O-Q-G-Coin2+-G-H-Coin1+-D-S-A-Ex1 En-O-Q-G-Coin2+-B-M-I-K-Coin1+-D-S-A-Ex1 En-O-Q-G-Coin2+-B-M-Q-H-Coin1+-D-S-A-Ex1 En-O-Q-G-Coin2+-G-H-Coin1+-K-L-R-Ex1 En-O-Q-G-Coin2+-B-M-I-K-Coin1+-K-L-R-Ex1 En-O-Q-G-Coin2+-B-M-Q-H-Coin1+-K-L-R-Ex1 En-O-M-B-Coin2+-G-H-Coin1+-D-S-A-Ex1 En-O-M-B-Coin2+-B-M-I-K-Coin1+-D-S-A-Ex1 En-O-M-B-Coin2+-B-M-Q-H-Coin1+-D-S-A-Ex1 En-O-M-B-Coin2+-G-H-Coin1+-K-L-R-Ex1 En-O-M-B-Coin2+-B-M-I-K-Coin1+-K-L-R-Ex1 En-O-M-B-Coin2+-B-M-Q-H-Coin1+-K-L-R-Ex1 | 24 |
