Fun (?) #AppliedMaths / #CS / #algorithm puzzle set by my child
Given a grid with obstacles and a start and finish point, is there an efficient way to determine the single obstacle, that when removed, results in the shortest path from start to finish?
(Generalisations welcome)
