Created
May 8, 2023 16:21
-
-
Save Untrusted-Game/2a5e959ab584896679d06fcb2f623449 to your computer and use it in GitHub Desktop.
Solution to level 17 in Untrusted: http://alex.nisnevich.com/untrusted/
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/*************** | |
* pointers.js * | |
*************** | |
* | |
* You! How are you still alive? | |
* | |
* Well, no matter. Good luck getting through this | |
* maze of rooms - you'll never see me or the Algorithm again! | |
*/ | |
function startLevel(map) { | |
function shuffle(o){ //v1.0 [http://bit.ly/1l6LGQT] | |
for(var j, x, i = o.length; i; j = Math.floor(Math.random() * i), | |
x = o[--i], o[i] = o[j], o[j] = x); | |
return o; | |
}; | |
map.createFromGrid( | |
['+++++++++++++++++++++++++++++++++++++++++++++', | |
'++o *++++o *++++o *++++o *++++o *++++o *+++++', | |
'+* @ o++* o++* o++* o++* o++* o++++', | |
'++o *++++o *++++o *++++o *++++o *++++o *+++++', | |
'+++++++++++++++++++++++++++++++++++++++++++++', | |
'+++++* o++++* o++++* o++++* o++++* o++++* o++', | |
'++++o *++o *++o *++o *++o *++o *+', | |
'+++++* o++++* o++++* o++++* o++++* o++++* o++', | |
'+++++++++++++++++++++++++++++++++++++++++++++', | |
'++o *++++o *++++o *++++o *++++o *++++o *+++++', | |
'+* o++* o++* o++* o++* o++* o++++', | |
'++o *++++o *++++o *++++o *++++o *++++o *+++++', | |
'+++++++++++++++++++++++++++++++++++++++++++++', | |
'+++++* o++++* o++++* o++++* o++++* o++++* o++', | |
'++++o *++o *++o *++o *++o *++o *+', | |
'+++++* o++++* o++++* o++++* o++++* o++++* o++', | |
'+++++++++++++++++++++++++++++++++++++++++++++', | |
'++o *++++o *++++o *++++o *++++o *++++o *+++++', | |
'+* o++* o++* o++* o++* o++* E o++++', | |
'++o *++++o *++++o *++++o *++++o *++++o *+++++', | |
'+++++++++++++++++++++++++++++++++++++++++++++'], | |
{ | |
'@': 'player', | |
'E': 'exit', | |
'+': 'block', | |
'o': 'teleporter', | |
'*': 'trap', | |
}, 2, 2); | |
var canvas = map.getCanvasContext(); | |
var teleportersAndTraps = map.getDynamicObjects(); | |
teleportersAndTraps = shuffle(teleportersAndTraps); | |
for (var i = 0; i < teleportersAndTraps.length; i+=2) { | |
var t1 = teleportersAndTraps[i]; | |
var t2 = teleportersAndTraps[i+1]; | |
// Point each teleporter to either another teleporter | |
// or a trap | |
if (t1.getType() == 'teleporter') { | |
t1.setTarget(t2); | |
} | |
if (t2.getType() == 'teleporter') { | |
t2.setTarget(t1); | |
} | |
// TODO find a way to remove the API docs | |
// wouldn't want the 'good doctor' to find | |
// out about map.getCanvasCoords()... | |
// inefficient, but we're hacking. Sort the teleporters | |
// and trap by order of X + Y * map.getWidth(); | |
teleportersAndTraps.sort((t1, t2) => { | |
const t1Score = t1.getX() + t1.getY() * map.getWidth(); | |
const t2Score = t2.getX() + t2.getY() * map.getWidth(); | |
return t1Score - t2Score; | |
}); | |
let lastTeleporter; | |
for (let i=0; i < teleportersAndTraps.length; i += 1) { | |
const item = teleportersAndTraps[i]; | |
if (item.getType() == 'teleporter') { | |
if (lastTeleporter) { | |
lastTeleporter.setTarget(item) | |
} | |
lastTeleporter = item; | |
} | |
} | |
} | |
} | |
function validateLevel(map) { | |
map.validateExactlyXManyObjects(1, 'exit'); | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment