This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import copy | |
import math | |
import random | |
from python.common.svg import Svg | |
def coordinate_to_string(i, j): | |
return str(i) + "," + str(j) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env ruby | |
# terrible word search generator | |
# inspired by http://cnlohr.blogspot.com/2014/02/to-make-terrible-wordsearches.html | |
if ARGV.length != 3 | |
STDERR.puts "usage: #$0 WIDTH HEIGHT WORD" | |
exit 1 | |
end | |
$word = ARGV[2].upcase |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# -------------------------------------------------------------------- | |
# An implementation of a "weave" maze (with over/under passages), | |
# using the Growing Tree maze generation algorithm. | |
# -------------------------------------------------------------------- | |
# -------------------------------------------------------------------- | |
# Helper data and methods | |
# -------------------------------------------------------------------- | |
N, S, E, W, U = 0x01, 0x02, 0x04, 0x08, 0x10 |