mirror of
https://github.com/robmcmullen/fujirun.git
synced 2024-06-07 11:29:30 +00:00
157 lines
3.1 KiB
Python
157 lines
3.1 KiB
Python
|
#!/usr/bin/env python
|
||
|
|
||
|
import numpy as np
|
||
|
|
||
|
maze = np.empty((24, 33), dtype=np.uint8)
|
||
|
|
||
|
tiledown = 0x1
|
||
|
tileup = 0x2
|
||
|
tileright = 0x4
|
||
|
tileleft= 0x8
|
||
|
tiledot = 0x10
|
||
|
|
||
|
tilechars = [
|
||
|
"X", # illegal
|
||
|
"X",
|
||
|
"X",
|
||
|
"|", # 3: up/down
|
||
|
"X",
|
||
|
"/", # 5: down/right
|
||
|
"\\", # 6: up/right
|
||
|
"+", # 7: up/down/right
|
||
|
"X",
|
||
|
"\\", # 9: left/down
|
||
|
"/", # 10: left/up
|
||
|
"+", # 11: left/up/down
|
||
|
"-", # 12: left/right
|
||
|
"T", # 13: left/right/down
|
||
|
"^", # 14: left/right/up
|
||
|
"X",
|
||
|
|
||
|
# And same again, with dots
|
||
|
"X", # illegal
|
||
|
"X",
|
||
|
"X",
|
||
|
"|", # 3: up/down
|
||
|
"X",
|
||
|
"/", # 5: down/right
|
||
|
"\\", # 6: up/right
|
||
|
"+", # 7: up/down/right
|
||
|
"X",
|
||
|
"\\", # 9: left/down
|
||
|
"/", # 10: left/up
|
||
|
"+", # 11: left/up/down
|
||
|
"-", # 12: left/right
|
||
|
"T", # 13: left/right/down
|
||
|
"^", # 14: left/right/up
|
||
|
"X",
|
||
|
]
|
||
|
|
||
|
# Screen has rows 0 - 23
|
||
|
# Maze is rows 1 - 22
|
||
|
mazetoprow = 1
|
||
|
mazebotrow = 22
|
||
|
|
||
|
# Screen has cols 0 - 39
|
||
|
# cols 0 - 32 are the maze, of which 1 - 31 are actually used
|
||
|
# 0 and 32 are border tiles having the value zero
|
||
|
# cols 33 - 39 is the score area
|
||
|
mazeleftcol = 1
|
||
|
mazerightcol = 31
|
||
|
mazescorecol = 33
|
||
|
|
||
|
vpath_num = 7
|
||
|
vpath_cols = [1, 6, 11, 16, 21, 26, 31]
|
||
|
vpath_top_tile = [
|
||
|
tiledot|tiledown|tileright,
|
||
|
tiledot|tiledown|tileleft|tileright,
|
||
|
tiledot|tiledown|tileleft|tileright,
|
||
|
tiledot|tiledown|tileleft|tileright,
|
||
|
tiledot|tiledown|tileleft|tileright,
|
||
|
tiledot|tiledown|tileleft|tileright,
|
||
|
tiledot|tiledown|tileleft,
|
||
|
]
|
||
|
vpath_bot_tile = [
|
||
|
tiledot|tileup|tileright,
|
||
|
tiledot|tileup|tileleft|tileright,
|
||
|
tiledot|tileup|tileleft|tileright,
|
||
|
tiledot|tileup|tileleft|tileright,
|
||
|
tiledot|tileup|tileleft|tileright,
|
||
|
tiledot|tileup|tileleft|tileright,
|
||
|
tiledot|tileup|tileleft,
|
||
|
]
|
||
|
|
||
|
def getrow(y):
|
||
|
return maze[y]
|
||
|
|
||
|
def clear_maze():
|
||
|
y = 0
|
||
|
while y < 24:
|
||
|
addr = getrow(y)
|
||
|
x = 0
|
||
|
while x < mazescorecol:
|
||
|
addr[x] = 0
|
||
|
x += 1
|
||
|
y += 1
|
||
|
|
||
|
def setrow(addr, x):
|
||
|
while x < 31:
|
||
|
addr[x] = tiledot|tileleft|tileright
|
||
|
x += 1
|
||
|
|
||
|
def setrow(row):
|
||
|
addr = getrow(row)
|
||
|
x = mazeleftcol
|
||
|
while x <= mazerightcol:
|
||
|
addr[x] = tiledot|tileleft|tileright
|
||
|
x += 1
|
||
|
|
||
|
def setvpath(col):
|
||
|
x = vpath_cols[col]
|
||
|
y = mazetoprow
|
||
|
addr = getrow(y)
|
||
|
addr[x] = vpath_top_tile[col]
|
||
|
y += 1
|
||
|
while y < mazebotrow:
|
||
|
addr = getrow(y)
|
||
|
addr[x] = tiledot|tileup|tiledown
|
||
|
y += 1
|
||
|
addr = getrow(y)
|
||
|
addr[x] = vpath_bot_tile[col]
|
||
|
|
||
|
def init_maze():
|
||
|
clear_maze()
|
||
|
setrow(mazetoprow)
|
||
|
setrow(mazebotrow)
|
||
|
|
||
|
counter = vpath_num
|
||
|
counter -= 1
|
||
|
while counter >= 0:
|
||
|
setvpath(counter)
|
||
|
counter -= 1
|
||
|
|
||
|
|
||
|
def get_text_maze():
|
||
|
lines = []
|
||
|
for y in range(24):
|
||
|
line = ""
|
||
|
for x in range(33):
|
||
|
tile = maze[y][x]
|
||
|
line += tilechars[tile]
|
||
|
lines.append(line)
|
||
|
return lines
|
||
|
|
||
|
def print_maze():
|
||
|
lines = get_text_maze()
|
||
|
for i in range(24):
|
||
|
print "%02d %s" % (i, lines[i])
|
||
|
|
||
|
def main():
|
||
|
init_maze()
|
||
|
print_maze()
|
||
|
|
||
|
|
||
|
|
||
|
if __name__ == "__main__":
|
||
|
main()
|