  Based on known methods for computing the number of distinct score sequences
for $n$-vertex tournaments, we develop algorithms for computing the number of
distinct score sequences for self-complementary tournaments, strong
tournaments, and tournaments that are both self-complementary and strong.
