 much time but is applied one simulation at a time, without requiring batching. The elimination only applies to the linear exploration term, and the search performs effectively with no or partial elimination for infinite or stopped searches.</p>

        <figure id="figure-9">
            <a href="figure9.gif"><img src="figure9.gif" /></a>
            <figcaption>Figure 9: ChessCoach initially prefers knight-to-f8 but eventually finds the bishop-takes-c5 tactic using SBLE-PUCT, despite an extremely low prio