Write a program that can search for a solution to the eight queens problem and print it in this form:
. . Q . . . . . Q . . . . . . . . . . Q . . . . …
Solve Project Euler's problem 19.
Solve Project Euler's problem 28.
Write a function that takes a 2-dimensional array of booleans representing a maze. There will be no wall in the upper-left or lower-right corner.
The procedure should print out the maze, indicating the shortest path from the upper-left corner to the lower-right corner. For example, the output might look like this:
..###### #.# # #.# # # #...# # ## ....# ######..
If no such path exists, print the maze without any path.