  We prove the existence and computability of optimal strategies in weighted
limit games, zero-sum infinite-duration games with a B\"uchi-style winning
condition requiring to produce infinitely many play prefixes that satisfy a
given regular specification. Quality of plays is measured in the maximal weight
of infixes between successive play prefixes that satisfy the specification.
