Skip to content

Instantly share code, notes, and snippets.

Created October 22, 2015 16:11
Show Gist options
  • Save anonymous/cdafb16f2aa048c87a43 to your computer and use it in GitHub Desktop.
Save anonymous/cdafb16f2aa048c87a43 to your computer and use it in GitHub Desktop.
Solution to level 13 in Untrusted: http://alex.nisnevich.com/untrusted/
/*
* robotMaze.js
*
* The blue key is inside a labyrinth, and extracting
* it will not be easy.
*
* It's a good thing that you're a AI expert, or
* we would have to leave empty-handed.
*/
function startLevel(map) {
// Hint: you can press R or 5 to "rest" and not move the
// player, while the robot moves around.
map.getRandomInt = function(min, max) {
return Math.floor(Math.random() * (max - min + 1)) + min;
}
map.placePlayer(map.getWidth()-1, map.getHeight()-1);
var player = map.getPlayer();
map.defineObject('robot', {
'type': 'dynamic',
'symbol': 'R',
'color': 'gray',
'onCollision': function (player, me) {
me.giveItemTo(player, 'blueKey');
},
'behavior': function (me) {
var search = function(start) {
var paths = new Map();
var newCells = map.getAdjacentEmptyCells(start[0], start[1]);
map.writeStatus("To Visit: " + toVisit);
for (var i of toVisit) {
// map.writeStatus("Item: " + i);
}
//[[x, y], direction]
//var first = map.getAdjacentEmptyCells(me.getX(), me.getY());
while (toVisit.length > 0) {
var next = toVisit.shift();
var here = next[0];
if (visited[here] == undefined) {
visited[here] = path.slice();
}
}
for (var i = 0; i < toVisit.length; i += 1) {
var newPath = path.slice();
newPath.push(toVisit[i])
}
return newPath;
}
if (me.steps == undefined) {
//me.steps = search([me.getX(), me.getY()]);
}
//map.writeStatus("Steps: " + m);
//var key = me.findNearest('blueKey');
//me.move(me.steps.shift()[1]);
if (me.canMove("down")) {
me.move("down");
} else {
me.move("right");
}
}
});
map.defineObject('barrier', {
'symbol': '░',
'color': 'purple',
'impassable': true,
'passableFor': ['robot']
});
map.placeObject(0, map.getHeight() - 1, 'exit');
map.placeObject(1, 1, 'robot');
map.placeObject(map.getWidth() - 2, 8, 'blueKey');
map.placeObject(map.getWidth() - 2, 9, 'barrier');
var autoGeneratedMaze = new ROT.Map.DividedMaze(map.getWidth(), 10);
autoGeneratedMaze.create( function (x, y, mapValue) {
// don't write maze over robot or barrier
if ((x == 1 && y == 1) || (x == map.getWidth() - 2 && y >= 8)) {
return 0;
} else if (mapValue === 1) { //0 is empty space 1 is wall
map.placeObject(x,y, 'block');
} else {
map.placeObject(x,y,'empty');
}
});
}
function validateLevel(map) {
map.validateExactlyXManyObjects(1, 'exit');
map.validateExactlyXManyObjects(1, 'robot');
map.validateAtMostXObjects(1, 'blueKey');
}
function onExit(map) {
if (!map.getPlayer().hasItem('blueKey')) {
map.writeStatus("We need to get that key!");
return false;
} else {
return true;
}
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment