Benham's method
Definition of Benham's method:
Do IRV, but before each elimination check if there is an un-eliminated candidate who beats each one of
the other un-eliminated candidates, and elect them if they exist.
X beats Y if more ballots rank X over Y than rank Y over X.
Benham's method is a Smith-efficient Condorcet method. This is because there will always be a point in the count where at least one Smith Set member is uneliminated, and that candidate must beat all other candidates by virtue of being in the Smith Set. Benham's method fails ISDA, however. [1]
Benham's method can be thought of as a Tideman alternative method that uses the Condorcet winner as its "set".
For more information, go to the Woodall's method article.