As before, double press green flag. If you have not seen the previous program please see here: https://scratch.mit.edu/projects/155417068/
This is a more efficient algorithm (though not the best) that seeks out the CLOSEST cat and destroys it instead of the queue solution. The problem with this greedy implementation is that it is not able to find the best LONG TERM solution to the cats (I. e. if there was a larger, but just SLIGHTLY farther bunch of cats and a single closer cat, it would make the wrong decision).
