ALGORITHM ANALYSIS:
x: width of board
y: height of board
b: number of blocks to add
a: block area
p: path length
m: number of possible boards
n: number of paths

Name				Order
board.cpp:			n/a
validLocation		1
get					1
set					1
addBlock			a
isBlocked			1
blockFits			a
isLike				x*y
Print				x*y
PrintPound			x*y
PrintPathed			x*y + p

main.cpp:			n/a
contains			p
pathFinder			p (per run)
					p*x*y (per full recursion)
shortestPath*		p*x*y + n
findMazes			x*y*(a^2) (per run)
					b*x*y*(a^2) (per full recursion)
getMazes			b*x*y*(a^2) + m*(p*x*y + n + x*y) + m^2 + m*(x*y + p)
findOneMaze			b*x*y*(a^2) + m*x*x