To compare a series of ligands using RBFE, researchers typically make a map or graph of planned transformations, where nodes are ligands and connecting edges are alchemical transformations between nodes. For the highest possible confidence when accounting for statistical errors, the resulting map would include all possible edges in the limit where all transformations are equally alchemically feasible. Graph redundancy can then be used to detect and correct for statistical error. However, the computational cost of highly redundant designs could become prohibitive as the number of nodes, 𝑛, increases since each RBFE calculation typically incurs substantial costs.