Dichotomy for finite tournaments of mixed-type

We characterize those finite tournaments T of mixed-type which admit a Taylor operation; in this case, the corresponding algebras of polymorphisms generate congruence meet-semidistributive varieties. If Tc denotes the structure with all unary singleton relations in addition to the edge relation of the tournament, then it will follow that the constraint satisfaction problem with template Tc satisfies the algebraic dichotomy conjecture.