Viewing Program

Program Data

Program thumbnail for "{props.program.title}"

Title	Maze! 99x99x4 (rows, cols, blockSize) === hard
ID	5551655665
Created	9 years ago, 1463512730532
Updated	7 years ago, 1521752732738
Code	// Thank you all for your votes and suggestions. :) // Extra comments have been removed to keep within contest guidelines. // Try the variables below and ask me if you run into any trouble. var playerX = 2, playerY = 2, rows = 99, columns = 99, blockSize = 4, endX = rows-3, endY = columns-3, wallColor = color(97, 142, 158), mazeColor = color(219, 219, 219), pathColor = color(240, 234, 125), playerColor = color(255, 0, 0), solutionColor = color(0, 255, 0), messageColor = color(255, 0, 0); var Maze = function ( wide, high, size ) { var w = wide + ( wide & 1 ? 0 : 1 ); var h = high + ( high & 1 ? 0 : 1 ); this.width = w; this.height = h; // center maze on screen this.size = size; this.x = 0.5 * ( width - ( w * size ) ); this.y = 0.5 * ( height - ( h * size ) ); this.cells = new Array (w); // initialize cells for ( var i = 0; i < w; i++ ) { var column = new Array ( h ); this.cells [ i ] = column; var visited; // top and bottom rows are all visited for ( var j = 0; j < h; j++) { // first and last columns are all visited visited = i === 0 \|\| i === w - 1 \|\| j === 0 \|\| j === h - 1; column [ j ] = { visited: visited, wall: true }; } } }; // https://en.wikipedia.org/wiki/Maze_generation_algorithm#Randomized_Prim.27s_algorithm Maze.prototype.build = function ( x, y ) { var r, cells = this.cells, cell = cells [ x ] [ y ], stack = [], xo, yo, xp, yp; // step 2.a "Pick a cell, mark it as part of the maze." cell.visited = true; cell.wall = false; do { // step 2.b "Add the walls of the cell to the wall list." for ( var i = 0; i < 4; i++ ) { if ( i & 2 ) { xo = 0; yo = i & 1 ? 2 : -2; } else { xo = i & 1 ? 2 : -2; yo = 0; } xp = x + xo; yp = y + yo; if ( xp > -1 && xp < this.width && yp > -1 && yp < this.height ) { cell = cells [ xp ] [ yp ]; if ( !cell.visited ) { xp = x + 0.5 * xo; yp = y + 0.5 * yo; cell = cells [ xp ] [ yp ]; cell.x = xp; cell.y = yp; if ( !cell.stacked ) { cell.stacked = true; stack.push ( cell ); } } } } // 3.1 "Pick a random wall from the list." r = random ( stack.length ) \| 0; cell = stack [ r ]; // if the current list of walls is not depleted if ( cell ) { x = cell.x; y = cell.y; var side; // wall is vertical if ( x & 1 && !( y & 1 ) ) { xp = x - 1; yp = y; side = cells [ xp ] [ yp ]; if ( side.visited ) { xp = x + 1; yp = y; side = cells [ xp ] [ yp ]; } // wall is horizontal } else if ( y & 1 && !( x & 1 ) ) { xp = x; yp = y - 1; side = cells [ xp ] [ yp ]; if ( side.visited ) { xp = x; yp = y + 1; side = cells [ xp ] [ yp ]; } } if ( !side.visited ) { side.visited = true; side.wall = false; x = xp; y = yp; cell.visited = true; cell.wall = false; } } // remove the wall from the list stack.splice ( r, 1 ); } while ( cell ); }; Maze.prototype.draw = function() { var mw = this.width, mh = this.height, size = this.size, w = mw * size, h = mh * size, xo = 0.5 * ( width - w ), yo = 0.5 * ( height - h ), cells = this.cells, cell; noStroke(); for ( var x = 0; x < mw; x++ ) { for ( var y = 0; y < mh; y++ ) { cell = cells [ x ] [ y ]; if ( cell.wall ) { fill(wallColor); } else if ( cell.walked ) { fill(pathColor); } else { fill(mazeColor); } rect ( xo + x * size, yo + y * size, size, size); } } }; var maze = false; var keyPressed = function () { if ( keyCode === UP ) { var cell = maze.cells [ playerX ] [ playerY - 1 ]; if ( !cell.wall ) { cell.walked = true; playerY--; } } else if ( keyCode === DOWN ) { var cell = maze.cells [ playerX ] [ playerY + 1 ]; if ( !cell.wall ) { cell.walked = true; playerY++; } } else if ( keyCode === LEFT ) { var cell = maze.cells [ playerX - 1 ] [ playerY ]; if ( !cell.wall ) { cell.walked = true; playerX--; } } else if ( keyCode === RIGHT ) { var cell = maze.cells [ playerX + 1 ] [ playerY ]; if ( !cell.wall ) { cell.walked = true; playerX++; } } }; var draw = function() { if ( !maze ) { maze = new Maze ( rows, columns, blockSize ); maze.build ( playerX, playerY ); maze.cells [ playerX ] [ playerY ].walked = true; } else { maze.draw (); fill(playerColor); rect(maze.x + blockSize * playerX, maze.y + blockSize * playerY, blockSize, blockSize); fill(solutionColor); rect(maze.x + blockSize * endX, maze.y + blockSize * endY, blockSize, blockSize); if ( playerX === endX && playerY === endY ) { fill(messageColor); textSize(22); textAlign(CENTER, CENTER); text("You Win! Press Restart to play again.", 0.5 * width, 0.5 * height); } } };
Folds
Fork	false
Key	ag5zfmtoYW4tYWNhZGVteXIUCxIKU2NyYXRjaHBhZBjxlZ7XFAw
Votes	314
Spin-Offs	13
Type	PJS
Width	400
Height	400
User Flagged	false
Origin Scratchpad	{"id":"5257150388","title":"Less Than 200 Challenge!","deleted":"false","official":"false"}
Hidden From Hotlist	false
Restricted Posting	false
By Child	false
Author Nick	流木
Author Name	humbleservant
Author ID	kaid_1034496681270447732882321
Author Profile Access	COACH

Archive Data

Added	10 months ago, 1739289437386
Updated	8 months ago, 1744844792515
Source Deleted	unknown