Viewing Program

Program Data

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

Title	Help Hopper Escape! Invisibility!
ID	5166789655789568
Created	11 years ago, 1395114552145
Updated	11 years ago, 1399305388876
Code	/** * Use the arrow keys to move Hopper through the maze. * * Start at the safe green square on the left. * Finish at the checkered flag on the right. * * Blue areas are impassable water. * * Guards patrol the area along a set route. * If you run into them you will lose a heart and * and must return to the beginning square. * The beginning square and finish square are safe from guards. * The game is over when you lose all hearts. * * Small red guards patrol areas farther from the exit. * Small green guards patrol areas closer to the exit. * Large red guards patrol areas mainly farther from the exit * and will venture closer. * Large green guards patrol areas mainly close to the exit * and will venture farther. * * Guards will appear depending on maze configuration. * * Press H to activate a blue crystal. * Blue crystals show you the exit route. * * Press K to activate a key. * Keys let you pass through an eastern wall * that you are touching. * * Press I to activate a green crystal. * Green crystals make you invisible to green guards * for 5 seconds. * * Press N at any time to go to the next maze. * * Press R at any time to restart the game. / /* * Help Hopper Escape * * Troy Cook / / This program uses a recursive routine to fill in an area with a random branching path. It does not calculate walls, but determines if a path can be made to an adjacent block. It starts with the exit block and completely fills in the area. Any block can be used as the beginning. Help will also solve the maze and draw the exit route on the path. 3/23 Added more guards with different patrol areas and speed. Corrected pathRandom routine. Beginning square is now safe. Invisibility to green guards. Updated Hopper movement. 3/19 Updated maze algorithm to increase difficulty. Start on the left and finish on the right. Water barriers. Health hearts. Game ends when you reach 0. Keys let you pass through an eastern wall. Added useful shortcut. 3/18 Added depth property to determine how far away each block is from the exit. Will use this for future features. / var bug = false; randomSeed(hour()+minute()+second()); var fonts = { serif: createFont("serif",null), sans: createFont("sans serif",null), curs: createFont("cursive",null), }; var defined = function(){ for (var i in arguments){ if (arguments[i] !== undefined){ return arguments[i]; } } return undefined; }; var Guard = function(p,pt,xs,ys,t,d){ this.p = p; // path array this.xs = xs; // x step this.ys = ys; // y step this.pd = defined(d,1); // path direction 1 or -1 this.pb = 1; this.pe = this.p.length-1; this.pp = (this.pd===1)?this.pb:this.pe; this.po = this.pp; this.ps = 0; this.pt = pt; // path time interval this.pn = millis()+this.pt; // path next time this.t = defined(t,0); this.i = [ getImage("avatars/piceratops-sapling"), getImage("avatars/leafers-sapling"), getImage("avatars/piceratops-ultimate"), getImage("avatars/leafers-ultimate"), ]; this.draw = function() { pushMatrix(); pushStyle(); if (millis()>this.pn){ this.pn = millis()+this.pt; this.ps += 0.05; if (this.ps >= 1){ this.ps = 0; this.po = this.pp; this.pp += this.pd; if (this.pp<this.pb \|\| this.pp>this.pe){ this.pp = constrain(this.pp,this.pb,this.pe); this.pd = -1; } } } imageMode(CENTER); this.r = lerp(this.p[this.po].r,this.p[this.pp].r,this.ps); this.c = lerp(this.p[this.po].c,this.p[this.pp].c,this.ps); var y = (this.r+0.5)this.ys; var x = (this.c+0.5)this.xs; translate(x,y); rotate(sin(millis()/3%360)5); image(this.i[this.t],0,0,this.xs1.5,this.ys1.5); popMatrix(); popStyle(); }; }; var Block = function(r,c,d,f){ this.r = r; this.c = c; this.p = [false,false,false,false]; this.d = d; this.f = f; }; var Maze = function(x,y,w,h,r,c,br,bc,er,ec){ this.x = defined(x,10); // left x this.y = defined(y,10); // top y this.w = defined(w,width-20); // width this.h = defined(h,height-20); // height this.r = defined(r,10); // number of rows this.c = defined(c,10); // number of columns this.ea = 1; // edge avoidance this.pw = 0.8; // path width this.md = 0; // path depth this.ci = getImage("creatures/Hopper-Happy"); this.cj = getImage("creatures/Hopper-Jumping"); this.cg = getImage("creatures/Hopper-Cool"); this.cl = 7; this.cli = getImage("space/healthheart"); this.ch = 7; this.chi = getImage("cute/GemBlue"); this.ck = 4; this.cki = getImage("cute/Key"); this.cv = 2; this.cvi = getImage("cute/GemGreen"); this.cvt = 0; // absolute expiry time this.cvc = 0; // countdown this.ready = false; this.r2y = function(r){ return rthis.ys; }; this.c2x = function(c){ return cthis.xs; }; this.isPath = function(r,c,p){ if (r<0 \|\| r>=this.r \|\| c<0 \|\| c>=this.c){ return false; } return this.p[r][c].p[p]; }; this.solve = function(){ // clear array this.s = []; var r = this.br; var c = this.bc; this.s.push(this.p[r][c]); for (var d=this.p[r][c].d; d>0; d--){ for (var p=0; p<4; p++){ var nr = r; var nc = c; switch(p){ case 0: // north nr --; break; case 1: // east nc ++; break; case 2: // south nr ++; break; case 3: // west nc --; break; } if (nr<0 \|\| nr>=this.r \|\| nc<0 \|\| nc>this.c){ continue; } if (this.p[r][c].p[p] && this.p[nr][nc].d === d-1){ r = nr; c = nc; this.s.push(this.p[r][c]); break; } } } this.sw = 0; this.sd = false; }; this.solveDraw = function(){ // draw solution var w = min(this.xs,this.ys); strokeWeight(w/3); stroke(0xFF44AAFF); strokeJoin(ROUND); noFill(); beginShape(POINTS); for (var s=0; s<this.sw; s++){ var x = this.c2x(this.s[s].c+0.5); var y = this.r2y(this.s[s].r+0.5); vertex(x,y); } endShape(); this.sw ++; if (this.sw>=this.s.length){ this.sw = 0; this.sd = false; } }; this.pathRandom = function(bd,ed){ bd = floor(bd); ed = floor(ed); var ld = min(bd,ed); var hd = max(bd,ed); var p = []; var c=0; var r=0; // get random block of highest depth depth rc:for (var ec=0; ec<this.c; ec++){ for (var er=0; er<this.r; er++){ if (this.p[er][ec].d === hd){ p[hd-ld]=this.p[er][ec]; c = ec; r = er; break rc; } } } // step through depth for (var d=hd-1; d>ld; d--){ var o = this.p[r][c]; if (o.p[0]===true && this.p[r-1][c].d===d){ r--; } else if (o.p[1]===true && this.p[r][c+1].d===d){ c++; } else if (o.p[2]===true && this.p[r+1][c].d===d){ r++; } else if (o.p[3]===true && this.p[r][c-1].d===d){ c--; } else { break; } p[d-ld]=this.p[r][c]; } if (bug){ print("ld"+ld+" hd"+hd); for (var i in p){ print("["+p[i].r+","+p[i].c+" "+p[i].d+"]"); } println(" "); } return p; }; this.path = function(p,r,c,d,b){ // p path array // r,c block to check // d depth // b beginning direction to get to this block // if out of bounds or block is visited then return if (r<0 \|\| r>=this.r \|\| c<0 \|\| c>=this.c \|\| p[r][c] !== undefined){ return false; } // set as block p[r][c] = new Block(r,c,d); // set direction to previous block p[r][c].p[(b+2)%4]=true; // set direction from previous block if (d>0){ if (b===0){ p[r+1][c].p[0]=true; } else if (b===1){ p[r][c-1].p[1]=true; } else if (b===2){ p[r-1][c].p[2]=true; } else if (b===3){ p[r][c+1].p[3]=true; } } // expand maximum depth this.md = max(this.md,d); // determine beginning direction if (random(1)>0.4){ b = (r<this.ea)?2:(r>=this.r-this.ea)?0:(c<this.ea)?1:(c>=this.c-this.ea)?3:floor(random(0,4)); } // determine direction step either forwards or backwards var s = random(1)>=0.5?1:-1; // loop through 4 directions for (var n=0; n<4; n++){ switch((sn+b+4)%4){ // make sure direction is 0 - 4 case 0: // north if (this.path(p,r-1,c,d+1,0)){ p[r][c].p[0] = true; } break; case 1: // east if (this.path(p,r,c+1,d+1,1)){ p[r][c].p[1] = true; } break; case 2: // south if (this.path(p,r+1,c,d+1,2)){ p[r][c].p[2] = true; } break; case 3: // west if (this.path(p,r,c-1,d+1,3)){ p[r][c].p[3] = true; } break; } } return true; }; this.make = function(){ this.br = floor(this.r/2); // begin row this.bc = 0; // begin column this.er = this.br; // end row this.ec = this.c-1; // end column this.xs = this.w/this.c; this.ys = this.h/this.r; this.cr = this.br; this.cc = this.bc; this.cro = this.cr; this.cco = this.cc; this.cs = 0; // clear array this.p = new Array(this.r); for (var r=0; r<this.r; r++){ this.p[r] = new Array(this.c); } // add barriers for (var bc=2; bc<this.c-2; bc+=floor(random(2,5))){ var bd = floor(random(2,this.r/5)); var br = floor(random(1,this.r)); for (var r=br; r<min(br+bd,this.r-2); r++){ for (var c=bc; c<min(bc+bd,this.c-2); c++){ this.p[r][c] = new Block(r,c,-1,0xFF0088FF); } } } this.md = 0; // reset maximum depth // pass path array, exit row, exit column and starting depth this.path(this.p,this.er,this.ec,0,3); this.solve(); this.bd = this.p[this.br][this.bc].d; // add guards with maximum of 4 this.g = []; for (var g=0; g<min(this.c/4,4); g++){ var t = g%4; if (bug){ println("g"+g+" t"+t+" bd"+this.bd+" md"+this.md); } if (t===0){ // pi guard is in back area if (this.md>(this.bd+8)){ var a = this.pathRandom(this.bd+1,this.md-1); this.g.push(new Guard(a,30,this.xs,this.ys,t,-1)); } } else if (t===1){ // leaf guard is in front if (this.bd>8){ var a = this.pathRandom(1,this.bd-2); this.g.push(new Guard(a,30,this.xs,this.ys,t,1)); } } else if (t===2){ // pi guard big is in back then moves to front if (this.bd>10 && this.md>this.bd+6){ var a = this.pathRandom(this.bd/2,this.md-4); this.g.push(new Guard(a,60,this.xs,this.ys,t,-1)); } } else if (t===3){ // leaf guard big is in front then moves to back if (this.bd>8 && this.md>this.bd+10){ var a = this.pathRandom(4,this.bd+(this.md-this.bd)/2); this.g.push(new Guard(a,60,this.xs,this.ys,t,1)); } } } // add shortcut if available var d = this.p[this.br][this.bc].d; sc:for (var c=floor(this.c0.3); c<floor(this.c0.7); c++){ for (var r=floor(this.r0.2); r<floor(this.r0.8); r++){ var n = this.p[r][c]; var s = this.p[r+1][c]; var e = this.p[r][c+1]; if (n.d>0 && s.d>0 && e.d>0){ if (n.p[2]===false && ((n.d<d-2 && s.d>d+2)\|\|(n.d>d+2 && s.d<d-2))){ n.p[2] = true; s.p[0] = true; break sc; } if (n.p[1]===false && ((n.d<d-2 && e.d>d+2)\|\|(n.d>d+2 && e.d<d-2))){ n.p[1] = true; e.p[3] = true; break sc; } } } } this.ready = true; }; this.keyPressed = function(k,kc){ var c = this.cc; var r = this.cr; switch(kc){ case UP: if (this.isPath(r,c,0) \|\| this.isPath(r-1,c,2)){ r --; } break; case DOWN: if (this.isPath(r,c,2) \|\| this.isPath(r+1,c,0)){ r ++; } break; case LEFT: if (this.isPath(r,c,3) \|\| this.isPath(r,c-1,1)){ c --; } break; case RIGHT: if (this.isPath(r,c,1) \|\| this.isPath(r,c+1,3)){ c ++; } break; } // column or row has changed if (this.cr!==r \|\| this.cc!==c){ if (this.cs===1){ this.cs=0; } this.cr = r; this.cc = c; } switch(k){ case "H": case "h": if (this.ch>0 && this.sd===false){ this.sd = true; this.sw = 0; this.ch --; } break; case "K": case "k": // if keys available if (this.ck>0){ // if away from right edge and // wall to east and // block to east is valid if (this.cc<this.c-1 && this.p[this.cr][this.cc].p[1]===false && this.p[this.cr][this.cc+1].d>0){ // pass through wall this.cc ++; this.ck --; } } break; case "I": case "i": // if green crystals available if (this.cv>0 && this.cvc===0){ // start invisibility this.cvc = 5000; this.cvt = millis()+5000; this.cv --; } break; case "N": case "n": if (!this.ready){ return; } if (this.r>this.c){ this.c++; } else { this.r++; } this.ready = false; break; case "R": case "r": Program.restart(); } }; this.hopper = function(){ pushMatrix(); pushStyle(); var x = this.c2x(lerp(this.cco,this.cc,this.cs)+0.5); var y = this.r2y(lerp(this.cro,this.cr,this.cs)+0.5); y -= sin(this.cs180)this.ys/3; this.cs = constrain(this.cs+0.1,0,1); if (this.cs === 1){ // save old position this.cro = this.cr; this.cco = this.cc; } translate(x,y); rotate(5sin(millis()/6%360)); imageMode(CENTER); if (this.cr===this.er && this.cc===this.ec){ translate(0,-this.ysabs(sin(millis()/3%360))/4); image(this.cj,0,0,this.xs,this.ys); } else { if (this.cvc>0){ image(this.cg,0,0,this.xs,this.ys); } else { image(this.ci,0,0,this.xs,this.ys); } } popMatrix(); popStyle(); }; this.finish = function(x,y){ pushMatrix(); pushStyle(); translate(x,y); fill(0xFFFFFFFF); noStroke(); rect(0,0,this.xs,this.ys); fill(0); for (var s=1; s<25; s += 2){ rect((s%5)this.xs/5,floor(s/5)this.ys/5,this.xs/5,this.ys/5); } popMatrix(); popStyle(); }; this.draw = function() { if (!this.ready){ this.make(); } textSize(this.w/6); textAlign(CENTER,CENTER); if (this.cl === 0){ // lose fill(255, 255, 0); text("Hopper\nMeal Was\nDelicious!\nPress R\nto Restart...",200,200); return; } pushMatrix(); pushStyle(); translate(this.x,this.y); // draw barriers noStroke(); for (var r=0; r<this.r; r++){ var y = floor(this.r2y(r)); for (var c=0; c<this.c; c++){ if (this.p[r][c].f){ fill(this.p[r][c].f); var x = floor(this.c2x(c)); rect(x,y,ceil(this.xs),ceil(this.ys)); } } } // draw maze stroke(0xFF886600); strokeCap(SQUARE); var w = (min(this.xs,this.ys)this.pw); strokeWeight(w); if (bug){ strokeWeight(1); } for (var r=0; r<this.r; r++){ var y = this.r2y(r+0.5); for (var c=0; c<this.c; c++){ var x = this.c2x(c+0.5); var o = this.p[r][c]; if (o.p[0]){ // north line(x,y,x,y-this.ys); } if (o.p[1]){ // east line(x,y,x+this.xs,y); } if (o.p[2]){ // south line(x,y,x,y+this.ys); } if (o.p[3]){ // west line(x,y,x-this.xs,y); } if (bug){ textSize(w); text(o.d,x,y); } } } if (this.sd){ this.solveDraw(); } // entrance noStroke(); fill(0, 255, 0, millis()/2&255); rect(this.c2x(this.bc),this.r2y(this.br),this.xs,this.ys); // exit this.finish(this.c2x(this.ec),this.r2y(this.er)); textSize(this.w/6); fill(255, 255, 0); textAlign(CENTER,CENTER); if (this.cr===this.er && this.cc===this.ec){ text("YOU FREED\nHOPPER!\nPress N for\nNew maze...",this.w/2,this.h/2); } else if (this.cr===this.br && this.cc===this.bc){ text("BEGIN!",this.w/2,this.h/2); } // draw character this.hopper(); // draw guards for (var i in this.g){ this.g[i].draw(); // check guard if (this.g[i].t%2===1 && this.cvc>0){ // invisible with green guard } else if (this.g[i].r === this.cr && this.g[i].c === this.cc && (this.cr!==this.br && this.cc!==this.bc)){ this.cc = this.bc; this.cr = this.br; this.cl --; } } resetMatrix(); // draw health imageMode(CENTER); for (var l=0; l<this.cl; l++){ image(this.cli,l20+10,10,20,20); } // draw help image(this.chi,200,5,20,30); textSize(20); fill(255); text("x"+this.ch,225,10); // draw keys image(this.cki,260,5,20,40); text("x"+this.ck,280,10); // draw invisible image(this.cvi,320,5,20,30); text("x"+this.cv,345,10); // update invisible if (this.cvc>0){ fill(200, 255, 200, 200); textSize(45); this.cvc = max(0,(this.cvt-millis())/1000); text("Inivisible to\nGreen Guards\n"+this.cvc.toFixed(0)+" seconds",200,100); } popMatrix(); popStyle(); }; }; frameRate(30); var ms = 6; var m = new Maze(10,10,380,380,ms,ms); textFont(fonts.curs,20); draw = function() { background(45, 5, 120); m.draw(); }; keyPressed = function(){ m.keyPressed(key.toString(),keyCode); }; // end
Folds
Fork	false
Key	ag5zfmtoYW4tYWNhZGVteXIXCxIKU2NyYXRjaHBhZBiAgMCwr-WWCQw
Votes	306
Spin-Offs	7
Type	PJS
Width	400
Height	400
User Flagged	false
Origin Scratchpad	{"id":"5935640072945664","title":"Brain Games!","deleted":"false","official":"false"}
Hidden From Hotlist	false
Restricted Posting	false
By Child	false
Author Nick	Troy Cook
Author Name	onetruetroy
Author ID	kaid_1050040908180717789041673
Author Profile Access	COACH

Archive Data

Added	10 months ago, 1739376117113
Updated	8 months ago, 1744844857876
Source Deleted	unknown