pch_xyz/ai
1
0
Fork 0
mirror of https://github.com/syuilo/ai.git synced 2024-09-19 19:31:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update gen-maze.ts

Browse source
This commit is contained in:
syuilo 2019-05-11 15:03:41 +09:00
parent 7bba6ec4a9
commit f5644e4e13
No known key found for this signature in database
GPG key ID: BDC4C49D06AB9D69
1 changed files with 17 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
src/modules/maze/gen-maze.ts
View file

@ -94,6 +94,8 @@ export function genMaze(seed, complexity?) {
const donut = rand(3) === 0; const donut = rand(3) === 0;
const donutWidth = mazeSize / 3; const donutWidth = mazeSize / 3;
const straightMode = rand(10) === 0;
// maze (filled by 'empty') // maze (filled by 'empty')
const maze: CellType[][] = new Array(mazeSize); const maze: CellType[][] = new Array(mazeSize);
for (let i = 0; i < mazeSize; i++) { for (let i = 0; i < mazeSize; i++) {
@ -130,7 +132,7 @@ export function genMaze(seed, complexity?) {
return false; return false;
} }
function diggFrom(x: number, y: number) { function diggFrom(x: number, y: number, prevDir?: Dir) {
const isUpDiggable = checkDiggable(x, y, 'top'); const isUpDiggable = checkDiggable(x, y, 'top');
const isRightDiggable = checkDiggable(x, y, 'right'); const isRightDiggable = checkDiggable(x, y, 'right');
const isDownDiggable = checkDiggable(x, y, 'bottom'); const isDownDiggable = checkDiggable(x, y, 'bottom');
@ -144,28 +146,37 @@ export function genMaze(seed, complexity?) {
if (isDownDiggable) dirs.push('bottom'); if (isDownDiggable) dirs.push('bottom');
if (isLeftDiggable) dirs.push('left'); if (isLeftDiggable) dirs.push('left');
const dir = dirs[rand(dirs.length)]; let dir: Dir;
if (straightMode) {
if (dirs.includes(prevDir)) {
dir = prevDir;
} else {
dir = dirs[rand(dirs.length)];
}
} else {
dir = dirs[rand(dirs.length)];
}
maze[x][y] = cellVariants[maze[x][y]].digg[dir]; maze[x][y] = cellVariants[maze[x][y]].digg[dir];
if (dir === 'top') { if (dir === 'top') {
maze[x][y - 1] = maze[x][y - 1] === 'empty' ? 'bottom' : 'cross'; maze[x][y - 1] = maze[x][y - 1] === 'empty' ? 'bottom' : 'cross';
diggFrom(x, y - 1); diggFrom(x, y - 1, dir);
return; return;
} }
if (dir === 'right') { if (dir === 'right') {
maze[x + 1][y] = maze[x + 1][y] === 'empty' ? 'left' : 'cross'; maze[x + 1][y] = maze[x + 1][y] === 'empty' ? 'left' : 'cross';
diggFrom(x + 1, y); diggFrom(x + 1, y, dir);
return; return;
} }
if (dir === 'bottom') { if (dir === 'bottom') {
maze[x][y + 1] = maze[x][y + 1] === 'empty' ? 'top' : 'cross'; maze[x][y + 1] = maze[x][y + 1] === 'empty' ? 'top' : 'cross';
diggFrom(x, y + 1); diggFrom(x, y + 1, dir);
return; return;
} }
if (dir === 'left') { if (dir === 'left') {
maze[x - 1][y] = maze[x - 1][y] === 'empty' ? 'right' : 'cross'; maze[x - 1][y] = maze[x - 1][y] === 'empty' ? 'right' : 'cross';
diggFrom(x - 1, y); diggFrom(x - 1, y, dir);
return; return;
} }
} }