Create alg3.h

Essentially Alg1 without the intelligent choosing, where available. Random instead! 
TODO: Find the largest and smallest Reward within solutions. Print MIN Reward Path and MAX Reward Path