« first day (1153 days earlier)      last day (517 days later) » 

5:19 PM
23
Q: Generate all solvable 2xN mazes

A usernameYour job is to write a program that takes a number N as input and outputs all 2-by-N mazes that are solvable. Output format can be in the form of any two distinct values representing wall and empty - I use x and . here but you can use anything. You can have a matrix, array, string, ascii art, wha...

Anyone want to do this in Prolog?
 

« first day (1153 days earlier)      last day (517 days later) »