/**
// MCM Foundations of AI
// Student Name: Sagar Gatla
// Student ID: 22262265
// Code Submission for the assignment World 1: A* to seek out the agent
// Description: Change the cosmetic style of the World to your own version
// The AI will go into the enemy (built-in to the World)
// Diagonal moves off
// Prove it is A* by drawing the paths on screen
**/
// Cloned by sagar gatla on 25 Oct 2022 from World "Complex World" by Starter user
// Please leave this clone trail here.
// ==== Starter World =================================================================================================
// This code is designed for use on the Ancient Brain site.
// This code may be freely copied and edited by anyone on the Ancient Brain site.
// To include a working run of this program on another site, see the "Embed code" links provided on Ancient Brain.
// ====================================================================================================================
// =============================================================================================
// More complex starter World
// 3d-effect Maze World (really a 2-D problem)
// Movement is on a semi-visible grid of squares
//
// This more complex World shows:
// - Skybox
// - Internal maze (randomly drawn each time)
// - Enemy actively chases agent
// - Music/audio
// - 2D world (clone this and set show3d = false)
// - User keyboard control (clone this and comment out Mind actions to see)
// =============================================================================================
// =============================================================================================
// Scoring:
// Bad steps = steps where enemy is within one step of agent.
// Good steps = steps where enemy is further away.
// Score = good steps as percentage of all steps.
//
// There are situations where agent is trapped and cannot move.
// If this happens, you score zero.
// =============================================================================================
// ===================================================================================================================
// === Start of tweaker's box ========================================================================================
// ===================================================================================================================
// The easiest things to modify are in this box.
// You should be able to change things in this box without being a JavaScript programmer.
// Go ahead and change some of these. What's the worst that could happen?
AB.clockTick = 70; // 70;
// Speed of run: Step every n milliseconds. Default 100.
AB.maxSteps = 1000;
// Length of run: Maximum length of run in steps. Default 1000.
AB.screenshotStep = 50;
// Take screenshot on this step. (All resources should have finished loading.) Default 50.
//---- global constants: -------------------------------------------------------
const show3d = true; // Switch between 3d and 2d view (both using Three.js)
const TEXTURE_WALL = '/uploads/sagarg/brick.jpg' ;//
const TEXTURE_MAZE = '/uploads/sagarg/bush.jpg' ;
const TEXTURE_AGENT = '/uploads/sagarg/jery.jpg' ;
const TEXTURE_ENEMY = '/uploads/sagarg/tom.jpg' ;
// credits:
// http://commons.wikimedia.org/wiki/File:Old_door_handles.jpg
// https://commons.wikimedia.org/wiki/Category:Pac-Man_icons
// https://commons.wikimedia.org/wiki/Category:Skull_and_crossbone_icons
// http://en.wikipedia.org/wiki/File:Inscription_displaying_apices_(from_the_shrine_of_the_Augustales_at_Herculaneum).jpg
const MUSIC_BACK = '/uploads/sagarg/Tales.mp3' //'/uploads/starter/Defense.Line.mp3' ;
const SOUND_ALARM = '/uploads/sagarg/Tom_and_Jerry_Prick_Sound_Effect.mp3' //'/uploads/starter/air.horn.mp3' ;
// credits:
// http://www.dl-sounds.com/royalty-free/defense-line/
// http://soundbible.com/1542-Air-Horn.html
const gridsize = 30; // 30; // number of squares along side of world
const NOBOX= 7 ; // 7; // percentage of noboxes
const NOBOXES = Math.trunc ( (gridsize * gridsize) / NOBOX );
// density of maze - number of internal boxes
// (bug) use trunc or can get a non-integer
const squaresize = 100; // size of square in pixels
const MAXPOS = gridsize * squaresize; // length of one side in pixels
const SKYCOLOR = 0xddffdd; // a number, not a string
const startRadiusConst = MAXPOS * 1.0 ; // distance from centre to start the camera at
const maxRadiusConst = MAXPOS * 10 ; // maximum distance from camera we will render things
//--- change ABWorld defaults: -------------------------------
ABHandler.MAXCAMERAPOS = maxRadiusConst ;
ABHandler.GROUNDZERO = true; // "ground" exists at altitude zero
//--- skybox: -------------------------------
// skybox is a collection of 6 files
// x,y,z positive and negative faces have to be in certain order in the array
// https://threejs.org/docs/#api/en/loaders/CubeTextureLoader
// credit: http://korzonrocknet.deviantart.com/art/Skybox-446554846
const SKYBOX_ARRAY = [
"/uploads/sagarg/skybox_right.jpg",
"/uploads/sagarg/skybox_left.jpg",
"/uploads/sagarg/skybox_top.jpg",
"/uploads/sagarg/skybox_bottom.jpg",
"/uploads/sagarg/skybox_near.jpg",
"/uploads/sagarg/skybox_far.jpg"
/*
"uploads/sagarg/bg2.jpg",//"/uploads/starter/dawnmountain-xpos.png",
"uploads/sagarg/bg2.jpg",//"/uploads/starter/dawnmountain-xneg.png",
"uploads/sagarg/bg2.jpg",//"/uploads/starter/dawnmountain-ypos.png",
"uploads/sagarg/bg2.jpg",//"/uploads/starter/dawnmountain-yneg.png",
"uploads/sagarg/bg2.jpg",//"/uploads/starter/dawnmountain-zpos.png",
"uploads/sagarg/bg2.jpg"//"/uploads/starter/dawnmountain-zneg.png"*/
];
// space skybox, credit:
// http://en.spaceengine.org/forum/21-514-1
// x,y,z labelled differently
/*
const SKYBOX_ARRAY = [
"/uploads/starter/sky_pos_z.jpg",
"/uploads/starter/sky_neg_z.jpg",
"/uploads/starter/sky_pos_y.jpg",
"/uploads/starter/sky_neg_y.jpg",
"/uploads/starter/sky_pos_x.jpg",
"/uploads/starter/sky_neg_x.jpg"
];
*/
// urban photographic skyboxes, credit:
// http://opengameart.org/content/urban-skyboxes
/*
const SKYBOX_ARRAY = [
"/uploads/starter/posx.jpg",
"/uploads/starter/negx.jpg",
"/uploads/starter/posy.jpg",
"/uploads/starter/negy.jpg",
"/uploads/starter/posz.jpg",
"/uploads/starter/negz.jpg"
];
*/
// ===================================================================================================================
// === End of tweaker's box ==========================================================================================
// ===================================================================================================================
// You will need to be some sort of JavaScript programmer to change things below the tweaker's box.
//--- Mind can pick one of these actions -----------------
const ACTION_LEFT = 0;
const ACTION_RIGHT = 1;
const ACTION_UP = 2;
const ACTION_DOWN = 3;
const ACTION_STAYSTILL = 4;
// in initial view, (smaller-larger) on i axis is aligned with (left-right)
// in initial view, (smaller-larger) on j axis is aligned with (away from you - towards you)
// contents of a grid square
const GRID_BLANK = 0;
const GRID_WALL = 1;
const GRID_MAZE = 2;
var BOXHEIGHT; // 3d or 2d box height
var GRID = new Array(gridsize); // can query GRID about whether squares are occupied, will in fact be initialised as a 2D array
var theagent, theenemy;
const GRID_ENEMY = 10; // added information if grid contains the actors, rather than checking globals
const GRID_AGENT = 20; // added information if grid contains the actors, rather than checking globals
var wall_texture, agent_texture, enemy_texture, maze_texture;
// enemy and agent position on squares
var ei, ej, ai, aj;
var badsteps;
var goodsteps;
const MAX_OPENSET = gridsize * gridsize;
//-----------------------------My Code-------------------------------------//
// diagonal option enabled significantly increases performance of the enemy bot
// and allows access to shorter routes
var diagonal = false;
// This variable and constant are used in drawfunction to draw a line between agent and enemy everytime it calculates A*
const PROOF = true;
var proofArray = [];
class plots {
constructor(i, j) {
this.i = i;
this.j = j;
}
}
var start = new plots();
var target = new plots();
//------------------My Code------------------------------------------------//
function loadResources() // asynchronous file loads - call initScene() when all finished
{
var loader1 = new THREE.TextureLoader();
var loader2 = new THREE.TextureLoader();
var loader3 = new THREE.TextureLoader();
var loader4 = new THREE.TextureLoader();
loader1.load ( TEXTURE_WALL, function ( thetexture )
{
thetexture.minFilter = THREE.LinearFilter;
wall_texture = thetexture;
if ( asynchFinished() ) initScene(); // if all file loads have returned
});
loader2.load ( TEXTURE_AGENT, function ( thetexture )
{
thetexture.minFilter = THREE.LinearFilter;
agent_texture = thetexture;
if ( asynchFinished() ) initScene();
});
loader3.load ( TEXTURE_ENEMY, function ( thetexture )
{
thetexture.minFilter = THREE.LinearFilter;
enemy_texture = thetexture;
if ( asynchFinished() ) initScene();
});
loader4.load ( TEXTURE_MAZE, function ( thetexture )
{
thetexture.minFilter = THREE.LinearFilter;
maze_texture = thetexture;
if ( asynchFinished() ) initScene();
});
}
function asynchFinished() // all file loads returned
{
if ( wall_texture && agent_texture && enemy_texture && maze_texture ) return true;
else return false;
}
//--- grid system -------------------------------------------------------------------------------
// my numbering is 0 to gridsize-1
function occupied ( i, j ) // is this square occupied
{
if ( ( ei == i ) && ( ej == j ) ) return true; // variable objects
if ( ( ai == i ) && ( aj == j ) ) return true;
if ( GRID[i][j] == GRID_WALL ) return true; // fixed objects
if ( GRID[i][j] == GRID_MAZE ) return true;
return false;
}
// translate my (i,j) grid coordinates to three.js (x,y,z) coordinates
// logically, coordinates are: y=0, x and z all positive (no negative)
// logically my dimensions are all positive 0 to MAXPOS
// to centre everything on origin, subtract (MAXPOS/2) from all dimensions
function translate ( i, j ) // used to size the screen
{
var v = new THREE.Vector3();
v.y = 0;
v.x = ( i * squaresize ) - ( MAXPOS/2 );
v.z = ( j * squaresize ) - ( MAXPOS/2 );
return v;
}
function initScene() // all file loads have returned
{
var i,j, shape, thecube;
// set up GRID as 2D array
for ( i = 0; i < gridsize ; i++ )
GRID[i] = new Array(gridsize);
// set up walls
for ( i = 0; i < gridsize ; i++ )
for ( j = 0; j < gridsize ; j++ )
if ( ( i==0 ) || ( i==gridsize-1 ) || ( j==0 ) || ( j==gridsize-1 ) )
{
GRID[i][j] = GRID_WALL;
shape = new THREE.BoxGeometry ( squaresize, BOXHEIGHT, squaresize );
thecube = new THREE.Mesh( shape );
thecube.material = new THREE.MeshBasicMaterial( { map: wall_texture } );
thecube.position.copy ( translate(i,j) ); // translate my (i,j) grid coordinates to three.js (x,y,z) coordinates
ABWorld.scene.add(thecube);
}
else
GRID[i][j] = GRID_BLANK;
// set up maze
for ( var c=1 ; c <= NOBOXES ; c++ )
{
i = AB.randomIntAtoB(1,gridsize-2); // inner squares are 1 to gridsize-2
j = AB.randomIntAtoB(1,gridsize-2);
GRID[i][j] = GRID_MAZE ;
shape = new THREE.BoxGeometry ( squaresize, BOXHEIGHT, squaresize );
thecube = new THREE.Mesh( shape );
thecube.material = new THREE.MeshBasicMaterial( { map: maze_texture } );
thecube.position.copy ( translate(i,j) ); // translate my (i,j) grid coordinates to three.js (x,y,z) coordinates
ABWorld.scene.add(thecube);
}
// set up enemy
// start in random location
do
{
i = AB.randomIntAtoB(1,gridsize-2);
j = AB.randomIntAtoB(1,gridsize-2);
}
while ( occupied(i,j) ); // search for empty square
ei = i;
ej = j;
shape = new THREE.BoxGeometry ( squaresize, BOXHEIGHT, squaresize );
theenemy = new THREE.Mesh( shape );
theenemy.material = new THREE.MeshBasicMaterial( { map: enemy_texture } );
ABWorld.scene.add(theenemy);
drawEnemy();
// set up agent
// start in random location
do
{
i = AB.randomIntAtoB(1,gridsize-2);
j = AB.randomIntAtoB(1,gridsize-2);
}
while ( occupied(i,j) ); // search for empty square
ai = i;
aj = j;
shape = new THREE.BoxGeometry ( squaresize, BOXHEIGHT, squaresize );
theagent = new THREE.Mesh( shape );
theagent.material = new THREE.MeshBasicMaterial( { map: agent_texture } );
ABWorld.scene.add(theagent);
drawAgent();
// finally skybox
// setting up skybox is simple
// just pass it array of 6 URLs and it does the asych load
ABWorld.scene.background = new THREE.CubeTextureLoader().load ( SKYBOX_ARRAY, function()
{
ABWorld.render();
AB.removeLoading();
AB.runReady = true; // start the run loop
});
}
// --- draw moving objects -----------------------------------
function drawEnemy() // given ei, ej, draw it
{
theenemy.position.copy ( translate(ei,ej) ); // translate my (i,j) grid coordinates to three.js (x,y,z) coordinates
ABWorld.lookat.copy ( theenemy.position ); // if camera moving, look back at where the enemy is
}
function drawAgent() // given ai, aj, draw it
{
theagent.position.copy ( translate(ai,aj) ); // translate my (i,j) grid coordinates to three.js (x,y,z) coordinates
ABWorld.follow.copy ( theagent.position ); // follow vector = agent position (for camera following agent)
}
///////////-----------------------------My Code-------------------------------//////
// A* function that returns the next position in the as a coordinate (i,j)
function aStar(grid, start, target) {
// Initialize both open and closed list
var openSet = [];
var child;
var completed = false;
//console.log(GRID,start,target.i,target.j)
var targetNode = aStarGrid[target.i][target.j]; // define the target
var startNode = aStarGrid[start.i][start.j]; // define the start
var currentNode;
var nextMove = new plots(start.i, start.j);
// Push the start node onto the openlist to start the analysis
openSet.push(startNode); // push startnode onto Openset
// clearup previous search - need to be more efficient with memory
console.info("cleaning up previous results");
for (i = 0; i < gridsize; i++) {
for (j = 0; j < gridsize; j++) {
currentNode = aStarGrid[i][j];
currentNode.f = currentNode.h = currentNode.g = 0;
currentNode.closed = false;
currentNode.parent = null;
}
}
// loop through all of the a* openlist or until target or error found
while ((openSet.length > 0) && !completed) {
if (openSet.length > MAX_OPENSET) {
// Prevent Memory Issues when debugging OpenSet
console.error("there is a problem with the openset, bail out!");
completed = true;
return nextMove;
}
// Sort the list based on the f value
openSet.sort((a, b) => (a.f > b.f) ? 1 : -1); //sort set by f
currentNode = openSet.shift(); // shift the first entry of OpenSet
currentNode.closed = true; // quick check for closed
console.info("Current: " + currentNode.i + ", " + currentNode.j + " - (O/C) is " + openSet.length);
if (currentNode == targetNode) {
// Proof array
if (PROOF){
proofArray.push(targetNode);
}
// Found Target - now backtrack to get next node
while (currentNode.parent != startNode) {
// if we require proof, push store path
if (PROOF){
proofArray.push(currentNode);
}
// backtrack to return the next move
currentNode = currentNode.parent;
}
completed = true;
// Proof array
if (PROOF){
proofArray.push(startNode);
}
} else {
// if we are not at target, build openSet
for (n = 0; n < currentNode.neighbors.length; n++) {
// for each of the neighbours, calculate the children
child = currentNode.neighbors[n];
// check if in closedSet or occupied
if (child.closed) {
// move to next child
} else if (iswall(child.i, child.j)) {
// closedSet.push(child);
child.closed = true;
} else {
// calculate values and add to openSet
if ((child.i == currentNode.i) || (child.j == currentNode.j))
child.g = currentNode.g + 10; // if not diagonal, use 10 as metric
else
child.g = currentNode.g + 14; // rougly the square path if diagonal
child.h = aStarHeuristics(child, targetNode);
child.f = child.g + child.h;
child.parent = currentNode;
if (openSet.indexOf(child) < 0) {
// if not in openSet
openSet.push(child);
}
} // check if closedSet
} // loop through neighbours
} //check if we have reached target
}
nextMove.i = currentNode.i;
nextMove.j = currentNode.j;
console.info("returning form a*: ");
return nextMove;
// end of openSet, and not completed.
}
function iswall(i, j) // is this square occupied
{
switch (GRID[i][j]) {
case GRID_WALL:
case GRID_MAZE:
return true;
default:
return false;
}
}
function aStarHeuristics(start, end) {
if (diagonal)
return (Math.pow(start.i - end.i, 2) + Math.pow((start.j - end.j), 2));
else
return (Math.abs(start.i - start.i) + Math.abs(start.j - end.j));
}
function gridSpot(i, j) {
// Location
this.i = i;
this.j = j;
// f, g, and h values for A*
this.f = 0;
this.g = 0;
this.h = 0;
// Neighbors
this.neighbors = [];
// Where did I come from?
this.parent = undefined;
this.closed = false; // are we in closed set
// Figure out who my neighbors are
this.addNeighbors = function () {
var i = this.i;
var j = this.j;
if (i < gridsize - 1) this.neighbors.push(aStarGrid[i + 1][j]);
if (i > 0) this.neighbors.push(aStarGrid[i - 1][j]);
if (j < gridsize - 1) this.neighbors.push(aStarGrid[i][j + 1]);
if (j > 0) this.neighbors.push(aStarGrid[i][j - 1]);
if (diagonal)
// diagonals are also neighbours:
{
if (i > 0 && j > 0) this.neighbors.push(aStarGrid[i - 1][j - 1]);
if (i < gridsize - 1 && j > 0) this.neighbors.push(aStarGrid[i + 1][j - 1]);
if (i > 0 && j < gridsize - 1) this.neighbors.push(aStarGrid[i - 1][j + 1]);
if (i < gridsize - 1 && j < gridsize - 1) this.neighbors.push(aStarGrid[i + 1][j + 1]);
}
};
}
var aStarGrid = [];
////A* grid list
// initialise a astar grid in parallel to main "GRID"
function aStarInit() {
var i, j;
// create the aStarGrid
for (i = 0; i < gridsize; i++) {
aStarGrid[i] = [];
for (j = 0; j < gridsize; j++) {
aStarGrid[i][j] = new gridSpot(i, j);
// console.log("A* Initialise: " + i + ", " + j);
}
}
for (i = 0; i < gridsize; i++) {
for (j = 0; j < gridsize; j++) {
aStarGrid[i][j].addNeighbors();
}
}
console.info("A* Initialise: Complete");
}
var lastProofLine = [];
var previousLine;
function drawProof() //This function is used to draw a line between the agent and the enemy
{
var point1; // local "Spots"
var point2; // local "Spots"
var line;
var oldMaterial = new THREE.LineBasicMaterial({color:'brown', linewidth:1 });//0x222222
// clear old line
if (lastProofLine.length > 1){
console.log("test",lastProofLine)
line = lastProofLine.shift();
lastProofLine[0].material = oldMaterial;
if (previousLine)
{
ABWorld.scene.remove(previousLine);
}
ABWorld.scene.add(line);
previousLine = line;
}
var mat = new THREE.LineBasicMaterial({color:'brown', linewidth:2 });
var geo = new THREE.BufferGeometry();
var vertices=[]
var verticesIndex=0
// in the proofArray
for ( i = proofArray.length; i > 1; i--,verticesIndex++)
{
point1 = proofArray.shift();
// geo.vertices.push( translate(point1.i, point1.j) );
if (point1.parent){
point1 = point1.parent;
// drawline between proofArrayPoints
//geo.vertices.push( translate(point1.i, point1.j) );
vertices.push(translate(point1.i, point1.j));
console.log("Line between " + point1.i + "," + point1.j + " and ")
}
else {
//geo.vertices.push( translate(point1.i, point1.j) );
vertices.push(translate(point1.i, point1.j) );
console.log("Line between " + point1.i + "," + point1.j + " and ")
}
}
const geometry = new THREE.BufferGeometry().setFromPoints( vertices );
line = new THREE.Line(geometry, mat);
// line.castShadow = true;
lastProofLine.push(line);
ABWorld.scene.add(line);
}
//------------------------------My Code--------------------------------------///
// --- take actions -----------------------------------//
function moveLogicalEnemy()
{
// move towards agent
// put some randomness in so it won't get stuck with barriers
var i, j;
start.i = ei;
start.j = ej;
target.i = ai;
target.j = aj;
console.log(start,target)
// call the a* algorithm to provide the best path between targets (GRID not necessary, as globals used)
var bestPath = aStar(GRID, start, target);
// Only Move if the space is empty
if (!occupied(bestPath.i, bestPath.j)) {
GRID[ei][ej] = GRID_BLANK; // Store Agents Position
// move enemy to new position
ei = bestPath.i;
ej = bestPath.j;
GRID[ei][ej] = GRID_ENEMY;
}
console.info("enemy moving to : " + ei + "," + ej)
}
function moveLogicalAgent( a ) // this is called by the infrastructure that gets action a from the Mind
{
var i = ai;
var j = aj;
if ( a == ACTION_LEFT ) i--;
else if ( a == ACTION_RIGHT ) i++;
else if ( a == ACTION_UP ) j++;
else if ( a == ACTION_DOWN ) j--;
if ( ! occupied(i,j) )
{
ai = i;
aj = j;
}
}
// --- key handling --------------------------------------------------------------------------------------
// This is hard to see while the Mind is also moving the agent:
// AB.mind.getAction() and AB.world.takeAction() are constantly running in a loop at the same time
// have to turn off Mind actions to really see user key control
// we will handle these keys:
var OURKEYS = [ 37, 38, 39, 40 ];
function ourKeys ( event ) { return ( OURKEYS.includes ( event.keyCode ) ); }
function keyHandler ( event )
{
if ( ! AB.runReady ) return true; // not ready yet
// if not one of our special keys, send it to default key handling:
if ( ! ourKeys ( event ) ) return true;
// else handle key and prevent default handling:
if ( event.keyCode == 37 ) moveLogicalAgent ( ACTION_LEFT );
if ( event.keyCode == 38 ) moveLogicalAgent ( ACTION_DOWN );
if ( event.keyCode == 39 ) moveLogicalAgent ( ACTION_RIGHT );
if ( event.keyCode == 40 ) moveLogicalAgent ( ACTION_UP );
// when the World is embedded in an iframe in a page, we want arrow key events handled by World and not passed up to parent
event.stopPropagation(); event.preventDefault(); return false;
}
// --- score: -----------------------------------
function badstep() // is the enemy within one square of the agent
{
if ( ( Math.abs(ei - ai) < 2 ) && ( Math.abs(ej - aj) < 2 ) ) return true;
else return false;
}
function agentBlocked() // agent is blocked on all sides, run over
{
return ( occupied (ai-1,aj) &&
occupied (ai+1,aj) &&
occupied ( ai,aj+1) &&
occupied ( ai,aj-1) );
}
function updateStatusBefore(a)
// this is called before anyone has moved on this step, agent has just proposed an action
// update status to show old state and proposed move
{
var x = AB.world.getState();
AB.msg ( " Step: " + AB.step + " x = (" + x.toString() + ") a = (" + a + ") " );
}
function updateStatusAfter() // agent and enemy have moved, can calculate score
{
// new state after both have moved
var y = AB.world.getState();
var score = ( goodsteps / AB.step ) * 100;
AB.msg ( " y = (" + y.toString() + ") <br>" +
" Bad steps: " + badsteps +
" Good steps: " + goodsteps +
" Score: " + score.toFixed(2) + "% ", 2 );
}
AB.world.newRun = function()
{
AB.loadingScreen();
AB.runReady = false;
badsteps = 0;
goodsteps = 0;
aStarInit();
if ( show3d )
{
BOXHEIGHT = squaresize;
ABWorld.init3d ( startRadiusConst, maxRadiusConst, SKYCOLOR );
}
else
{
BOXHEIGHT = 1;
ABWorld.init2d ( startRadiusConst, maxRadiusConst, SKYCOLOR );
}
loadResources(); // aynch file loads
// calls initScene() when it returns
document.onkeydown = keyHandler;
};
AB.world.getState = function()
{
var x = [ ai, aj, ei, ej ];
return ( x );
};
AB.world.takeAction = function ( a )
{
updateStatusBefore(a); // show status line before moves
moveLogicalAgent(a);
if ( ( AB.step % 2 ) == 0 ) // slow the enemy down to every nth step
moveLogicalEnemy();
if ( badstep() ) badsteps++;
else goodsteps++;
drawAgent();
drawEnemy();
updateStatusAfter(); // show status line after moves
if ( agentBlocked() ) // if agent blocked in, run over
{
AB.abortRun = true;
goodsteps = 0; // you score zero as far as database is concerned
musicPause();
soundAlarm();
}
// Proof array ------------------------this is to draw a line between agent and enemy-----
if (PROOF){
drawProof();
}
};
AB.world.endRun = function()
{
musicPause();
if ( AB.abortRun ) AB.msg ( " <br> <font color=red> <B> Agent trapped. Final score zero. </B> </font> ", 3 );
else AB.msg ( " <br> <font color=green> <B> Run over. </B> </font> ", 3 );
};
AB.world.getScore = function()
{
// only called at end - do not use AB.step because it may have just incremented past AB.maxSteps
var s = ( goodsteps / AB.maxSteps ) * 100; // float like 93.4372778
var x = Math.round (s * 100); // 9344
return ( x / 100 ); // 93.44
};
// --- music and sound effects ----------------------------------------
var backmusic = AB.backgroundMusic ( MUSIC_BACK );
function musicPlay() { backmusic.play(); }
function musicPause() { backmusic.pause(); }
function soundAlarm()
{
var alarm = new Audio ( SOUND_ALARM );
alarm.play(); // play once, no loop
}