Editing Las Vegas algorithm (section)

== Optimal Las Vegas algorithm ==
In order to make a Las Vegas algorithm optimal, the expected run time should be minimized. This can be done by:
# The Las Vegas algorithm ''A''(''x'') runs repeatedly for some number ''t''<sub>1</sub> steps. If ''A''(''x'') stops during the run time then ''A''(''x'') is done; otherwise, repeat the process from the beginning for another ''t''<sub>2</sub> steps, and so on.
# Designing a strategy that is optimal among all strategies for ''A''(''x''), given the full information about the distribution of ''T<sub>A</sub>''(''x'').

The existence of the optimal strategy might be a fascinating theoretical observation. However, it is not practical in real life because it is not easy to find the information of distribution of ''T<sub>A</sub>''(''x''). Furthermore, there is no point of running the experiment repeatedly to obtain the information about the distribution since most of the time, the answer is needed only once for any ''x''.<ref>{{cite journal |last=Luby |first=Michael |date=27 September 1993 |title=Optimal Speedup of Las Vegas algorithms |journal=Information Processing Letters|volume=47|issue=4 |pages=173–180|doi=10.1016/0020-0190(93)90029-9}}</ref>