← 都来码 / Dolaima← 例程索引go/app/maze.go▶ 在浏览器里试玩 原文

go/app/maze.go · 6557 字节 · 下载原文

▶ 在浏览器里试玩

// 迷宫 —— 用 **Go** 写的手机小游戏(探索 / 每局现生成)
// Maze — a small phone game written in **Go**
//
// 玩法(与 Examples/c/app/maze.c / Examples/python/app/maze.py 同一套):
//   每局**现生成**一张新迷宫(深度优先挖洞,一定连通、一定有路);
//   方向键 / 点屏幕四边移动,走到右下角红格即通关;ESC / 通关后点一下换一张。
//
// ## 生成用**显式栈**,不用递归(理由同其它语言版:固定额度栈会被吃掉)
//
// ## Go 这一路的写法约束(见 Examples/go/app/snake.go 文件头)
//   · 全部状态放一个模块级数组 `A`;数字走逐位 `digitStr`;函数名带 `mz` 前缀。
//
// 跑法 —— 手机:vml run examples/go/maze.go
// 跑法 —— 桌面:vmlcli Examples/go/maze.go --screen 480x640 --frames /tmp/fr

import "vmlui"

// 分区:0..440 = 迷宫格;441..952 = 栈 X;953..1464 = 栈 Y
// 1465=px 1466=py 1467=won 1468=steps 1469=seed 1470=top 1471=cell 1472=ox 1473=oy
// 1474=w 1475=h 1476=lang 1477=frames 1478=tid 1479=i 1480=k 1481=n 1482=cx 1483=cy
// 1484=t 1485=tx 1486=ty 1487=dl 1488=dr 1489=dt 1490=db
var A [1500]int

const mzMaxFrames = 12000

func mzDigitStr(d int) string {
	if d == 0 {
		return "0"
	}
	if d == 1 {
		return "1"
	}
	if d == 2 {
		return "2"
	}
	if d == 3 {
		return "3"
	}
	if d == 4 {
		return "4"
	}
	if d == 5 {
		return "5"
	}
	if d == 6 {
		return "6"
	}
	if d == 7 {
		return "7"
	}
	if d == 8 {
		return "8"
	}
	return "9"
}

func mzDrawNum(x int, y int, v int, col int, size int, anchor int) {
	nd := 1
	t := v
	for t >= 10 {
		t = t / 10
		nd = nd + 1
	}
	px := x
	k := nd
	for k > 0 {
		k = k - 1
		pw := 1
		q := 0
		for q < k {
			pw = pw * 10
			q = q + 1
		}
		ui_2d_text(px, y, mzDigitStr((v/pw)%10), col, size, anchor)
		px = px + size/2
	}
}

func mzRelayout() {
	A[1474] = ui_scr_get_w()
	A[1475] = ui_scr_get_h()
	if A[1474] <= 0 {
		A[1474] = 360
	}
	if A[1475] <= 0 {
		A[1475] = 620
	}
	// 顶部步数 / 底部提示先占掉固定份,21×21 迷宫取宽高较小的一边,方屏也铺满可用区。
	pad := A[1474] / 60
	if pad < 8 {
		pad = 8
	}
	top := 58
	bottom := 28
	avail := A[1475] - top - bottom
	if avail < 42 {
		avail = 42
	}
	side := A[1474] - 2*pad
	if avail < side {
		side = avail
	}
	A[1471] = side / 21
	if A[1471] < 3 {
		A[1471] = 3
	}
	A[1472] = (A[1474] - 21*A[1471]) / 2
	A[1473] = top + (avail - 21*A[1471]) / 2
}

func mzNew() {
	i := 0
	for i < 441 {
		A[i] = 1
		i = i + 1
	}
	A[1469] = 20268
	A[1470] = 0
	A[1*21+1] = 0
	A[441] = 1
	A[953] = 1
	A[1470] = 1
	for A[1470] > 0 {
		A[1482] = A[441+A[1470]-1]
		A[1483] = A[953+A[1470]-1]
		A[1481] = 0
		// 四个方向:栈顶 (cx, cy) 的邻居里挑「还是墙」的
		top := A[1470]
		cx := A[441+top-1]
		cy := A[953+top-1]
		n := 0
		if cx+2 < 20 && A[(cx+2)*21+cy] == 1 {
			A[1491+n] = 0
			n = n + 1
		}
		if cx-2 > 0 && A[(cx-2)*21+cy] == 1 {
			A[1491+n] = 1
			n = n + 1
		}
		if cy+2 < 20 && A[cx*21+cy+2] == 1 {
			A[1491+n] = 2
			n = n + 1
		}
		if cy-2 > 0 && A[cx*21+cy-2] == 1 {
			A[1491+n] = 3
			n = n + 1
		}
		if n == 0 {
			A[1470] = A[1470] - 1
		} else {
			A[1469] = (A[1469] * 1103 + 12345) % 32768
			k := A[1491+(A[1469]/256)%n]
			if k == 0 {
				A[(cx+1)*21+cy] = 0
				cx = cx + 2
			} else if k == 1 {
				A[(cx-1)*21+cy] = 0
				cx = cx - 2
			} else if k == 2 {
				A[cx*21+cy+1] = 0
				cy = cy + 2
			} else {
				A[cx*21+cy-1] = 0
				cy = cy - 2
			}
			A[cx*21+cy] = 0
			if A[1470] < 512 {
				A[441+A[1470]] = cx
				A[953+A[1470]] = cy
				A[1470] = A[1470] + 1
			}
		}
	}
	i = 0
	for i < 3 {
		A[(19-i)*21+19] = 0
		A[19*21+19-i] = 0
		i = i + 1
	}
	A[1465] = 1
	A[1466] = 1
	A[1467] = 0
	A[1468] = 0
}

func mzMove(nx int, ny int) {
	if A[1467] != 0 {
		return
	}
	if nx < 0 || ny < 0 || nx >= 21 || ny >= 21 {
		return
	}
	if A[nx*21+ny] != 0 {
		return
	}
	A[1465] = nx
	A[1466] = ny
	A[1468] = A[1468] + 1
	if nx == 19 && ny == 19 {
		A[1467] = 1
	}
}

func mzDraw() {
	lang := A[1476]
	tSteps := "steps"
	tWon := "Out! Tap / ESC for a new maze"
	tHint := "Arrows / tap a screen edge; reach the red cell"
	if lang == 0 {
		tSteps = "步数"
		tWon = "走出来了!点一下/ESC 换一张"
		tHint = "方向键 / 点屏幕四边,走到红格"
	}

	ui_2d_clear(-15724520)

	x := 0
	for x < 21 {
		y := 0
		for y < 21 {
			col := -15066588
			if A[x*21+y] == 1 {
				col = -14013898
			}
			ui_2d_rect(A[1472]+x*A[1471], A[1473]+y*A[1471], A[1471], A[1471], col, 1, 0, 0)
			y = y + 1
		}
		x = x + 1
	}
	ui_2d_rect(A[1472]+19*A[1471]+1, A[1473]+19*A[1471]+1, A[1471]-2, A[1471]-2, -2069424, 1, 0, 2)
	ui_2d_rect(A[1472]+A[1465]*A[1471]+1, A[1473]+A[1466]*A[1471]+1, A[1471]-2, A[1471]-2, -11409298, 1, 0, 2)

	mzDrawNum(10, 19, A[1468], -1513232, 15, 0)
	ui_2d_text(10, 46, tSteps, -6643536, 10, 0)

	statusSize := 15
	hintSize := 11
	if A[1474] < 360 {
		statusSize = 12
		hintSize = 9
	}
	if A[1467] == 1 {
		ui_2d_text(A[1474]/2, A[1475]-26, tWon, -1513232, statusSize, 1)
	} else {
		ui_2d_text(A[1474]/2, A[1475]-26, tHint, -6643536, hintSize, 1)
	}
	ui_2d_present()
}

func main() {
	A[1476] = ui_scr_get_language()
	ui_win_open("迷宫", 0, 0)
	ui_scr_set_keep_on(1)

	mzRelayout()
	mzNew()
	mzDraw()

	A[1478] = ui_timer_set(120, 0)

	for ui_win_is_closed() == 0 {
		t := ui_msg_fetch_wait(0)
		if t == 10 {
			break
		}

		if t == 1 {
			A[1480] = ui_msg_get_a()
			if A[1480] == 27 {
				mzNew()
			} else if A[1480] == 37 {
				mzMove(A[1465]-1, A[1466])
			} else if A[1480] == 39 {
				mzMove(A[1465]+1, A[1466])
			} else if A[1480] == 38 {
				mzMove(A[1465], A[1466]-1)
			} else if A[1480] == 40 {
				mzMove(A[1465], A[1466]+1)
			}
			mzDraw()
			continue
		}

		if t == 6 || t == 4 {
			if A[1467] == 1 {
				mzNew()
			} else {
				A[1485] = ui_msg_get_a()
				A[1486] = ui_msg_get_b()
				A[1487] = A[1485]
				A[1488] = A[1474] - A[1485]
				A[1489] = A[1486]
				A[1490] = A[1475] - A[1486]
				if A[1487] <= A[1488] && A[1487] <= A[1489] && A[1487] <= A[1490] {
					mzMove(A[1465]-1, A[1466])
				} else if A[1488] <= A[1489] && A[1488] <= A[1490] {
					mzMove(A[1465]+1, A[1466])
				} else if A[1489] <= A[1490] {
					mzMove(A[1465], A[1466]-1)
				} else {
					mzMove(A[1465], A[1466]+1)
				}
			}
			mzDraw()
			continue
		}

		if t == 11 {
			mzRelayout()
			mzDraw()
			continue
		}

		if t == 9 {
			A[1477] = A[1477] + 1
			if A[1477] >= mzMaxFrames {
				break
			}
			mzDraw()
			continue
		}
	}

	ui_timer_kill(A[1478])
	ui_scr_set_keep_on(0)
	ui_win_close()
}