Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with maze
Search options not deleted
user 16922
This tag is for challenges relating to mazes, typically generating or navigating them. This often is used with the [ascii-art] tag, a common method of demonstrating the mazes
40
votes
14
answers
10k
views
Maze Generation [closed]
The goal: generate a random-looking maze using an algorithm of your choice, then output the maze graphically (printing counts).
The width and height are determined by you. … Cycles in the maze are allowed and, are encouraged, if the result is reasonable.
Language abuse encouraged. …
- 1,025
33
votes
Maze Generation
C: 364 Bytes
#define I int
m[1600],i=0,r;f(I x,I y,I l){m[80*y+x]|=l;I d[]={x-1,y,2,1,x+1,y,1,2,x,y-1,8,4,x,y+1,4,8},
s[]={5,5,5,5},j=0;for(;j<4;){L:r=rand()%4;for(I k=0;k<4;)if(s[k++]==r)goto L;s[j] …
- 1,025
7
votes
Maze Generation
Expected output (on 80-character terminal):
I regret this isn't a very hard maze (in fact, no backtracking to inner rings is required (and you should be able to find a path from the perimeter to the center …
- 1,025