Depending on the Resolution of #3, we could use the complexity of the requirement to sort locations by requirement complexity. This would let us reduce the available location scan time by taking the state of the world, executing a binary search against a list of Locations till we're just above the solvable complexity, and scanning down.
Depending on the Resolution of #3, we could use the complexity of the requirement to sort locations by requirement complexity. This would let us reduce the available location scan time by taking the state of the world, executing a binary search against a list of Locations till we're just above the solvable complexity, and scanning down.