“…While computer algorithms to generate permutation sequences were important, other researchers turned their attention to computing exact probability values for known statistics. Gregory80 and Tritchler and Pedrini,81 for example, confined their applications to the Fisher exact test for 2 × 2 contingency tables, while Agresti and Wackerly,82 Agresti et al,83 Fleishman,84 Howell and Gordon,85 and March86 attempted to extend the Fisher hypergeometric procedure to larger r × c contingency tables, and others applied permutation procedures to, for example, the Pitman test for two independent samples,87 the F test for completely randomized designs,88 the F test for randomized block designs,89 the chi‐squared test for goodness‐of‐fit,90 the Kruskal–Wallis test for ranks,91 and alternative choices of rank scores 92,93. In addition, Edgington provided permutation procedures and examples for an extensive inventory of statistical tests in 1969 (Ref 94, pp.…”