Function aoc::year2016::day17::explore

source ยท
fn explore(shared: &Shared, local: &mut State)
Expand description

Explore at most 100 paths, stopping sooner if we run out. 100 is chosen empirically as the amount that results in the least total time taken.

Too low and threads waste time locking the mutex, reading and writing global state. Too high and some threads are starved with no paths, while other threads do all the work.