feat: breadth-first search algorithm - #102

Nice job!
I took the liberty of making few modifications to simply the code such as:

• Switch from loop to while loops when possible
• Remove the Queue type which was just an Array wrapper
• Shuffle the directions when checking neighbors to avoid having hard coded patterns in game (like if the next move can either be North or West, we don't want it to be always North for instance but pseudo randomly one of those).
• Fixed a test where the grid was not the same as the comment