formatted files

Maze.js

@@ -14,20 +14,39 @@ class Maze {
   constructor(mazeSettings) {
     this.prng = mazeSettings.prng ?? Math;
     this.width = mazeSettings.width ||
-      mazeSettings.xSize || mazeSettings.size || mazeSettings.height || mazeSettings.ySize || 30;
+      mazeSettings.xSize || mazeSettings.size || mazeSettings.height ||
+      mazeSettings.ySize || 30;
     this.height = mazeSettings.height ||
       mazeSettings.ySize || mazeSettings.size || this.width;
     this.finishedGenerating = false;
     this.seed = mazeSettings.seed ?? Math.floor(Math.random() * 10e8);
     this.algorithm = mazeSettings.algorithm;
     this.algorithmId = mazeSettings.algorithmId;
-    
+
     this.entrance = this.getXYPosition(mazeSettings.entrance ?? "top left");
 
     this.exit = this.getXYPosition(mazeSettings.exit ?? "bottom right");
 
-    this.entrance.direction = this.entrance.direction ?? (this.entrance.x <= 0 ? "W" : this.entrance.x >= this.width-1 ? "E" : this.entrance.y <= 0 ? "N" : this.entrance.y >= this.width-1 ? "S" : " ");
-    this.exit.direction = this.exit.direction ?? (this.exit.x <= 0 ? "W" : this.exit.x >= this.width-1 ? "E" : this.exit.y <= 0 ? "N" : this.exit.y >= this.width-1 ? "S" : " ");
+    this.entrance.direction = this.entrance.direction ??
+      (this.entrance.x <= 0
+        ? "W"
+        : this.entrance.x >= this.width - 1
+        ? "E"
+        : this.entrance.y <= 0
+        ? "N"
+        : this.entrance.y >= this.width - 1
+        ? "S"
+        : " ");
+    this.exit.direction = this.exit.direction ??
+      (this.exit.x <= 0
+        ? "W"
+        : this.exit.x >= this.width - 1
+        ? "E"
+        : this.exit.y <= 0
+        ? "N"
+        : this.exit.y >= this.width - 1
+        ? "S"
+        : " ");
 
     if (
       this.algorithmId === "sidewinder" ||
@@ -106,7 +125,7 @@ class Maze {
   }
 
   step() {
-    if(this.finishedGenerating) return false;
+    if (this.finishedGenerating) return false;
     this.takeStep();
     return !this.finishedGenerating;
   }

algorithms/10Print.js

@@ -2,39 +2,39 @@ import Maze from "../Maze.js";
 import {
   opposite,
   dx,
-  dy
+  dy,
 } from "../directions.js";
 
 class TenPrint extends Maze {
   resetVariables() {
     this.currentCell = {
       x: 0,
-      y: 0
-    }
+      y: 0,
+    };
     this.allowOutsideConnections = false;
   }
 
   takeStep() {
     let passageDirection = this.prng.random() < 0.5 ? "S" : "E";
     let neighbor1 = {
       x: this.currentCell.x + dx[passageDirection],
-      y: this.currentCell.y + dy[passageDirection]
+      y: this.currentCell.y + dy[passageDirection],
     };
     let neighbor2 = {
       x: this.currentCell.x + dx[opposite[passageDirection]],
-      y: this.currentCell.y + dy[opposite[passageDirection]]
+      y: this.currentCell.y + dy[opposite[passageDirection]],
     };
-    
+
     if (this.cellIsInMaze(neighbor1) || this.allowOutsideConnections) {
       this.removeWall({
         x: this.currentCell.x,
-        y: this.currentCell.y
+        y: this.currentCell.y,
       }, passageDirection);
     }
     if (this.cellIsInMaze(neighbor2) || this.allowOutsideConnections) {
       this.removeWall({
         x: this.currentCell.x,
-        y: this.currentCell.y
+        y: this.currentCell.y,
       }, opposite[passageDirection]);
     }
 
@@ -44,10 +44,7 @@ class TenPrint extends Maze {
       this.currentCell.x = this.currentCell.y % 2;
       if (this.currentCell.y >= this.height) this.finishedGenerating = true;
     }
-
   }
-
 }
 
-
-export default TenPrint;
+export default TenPrint;

algorithms/AldousBroder.js

@@ -25,7 +25,6 @@ class AldousBroder extends Maze {
 
   //called every time the maze needs to be updated
   takeStep() {
-
     let possibleDirections = [];
     if (this.currentCell.y !== 0) possibleDirections.push("N");
     if (this.currentCell.y !== this.height - 1) possibleDirections.push("S");
@@ -54,7 +53,6 @@ class AldousBroder extends Maze {
     if (this.totalVisted >= this.width * this.height) {
       this.finishedGenerating = true;
     }
-
   }
 }
 

algorithms/BinaryTree.js

@@ -22,7 +22,6 @@ class BinaryTree extends Maze {
     ) {
       this.finishedGenerating = true;
     }
-
   }
 }
 

algorithms/Ellers.js

@@ -75,13 +75,11 @@ class Eller extends Maze {
   }
 
   takeStep() {
-
     if (this.mode === this.HORIZONTAL) {
       this.horizontalStep();
     } else {
       this.verticalStep();
     }
-
   }
 }
 

algorithms/HuntAndKill.js

@@ -23,7 +23,6 @@ class HuntAndKill extends Maze {
   }
 
   takeStep() {
-
     //random walk
     if (!this.hunting) {
       this.visited[this.currentCell.y][this.currentCell.x] = true;
@@ -149,7 +148,6 @@ class HuntAndKill extends Maze {
         }
       }
     }
-
   }
 }
 

algorithms/Kruskals.js

@@ -32,7 +32,6 @@ class Kruskals extends Maze {
   }
 
   takeStep() {
-
     let edge = this.edges.pop();
     let cell1 = {
       x: edge.x,
@@ -57,7 +56,6 @@ class Kruskals extends Maze {
     }
 
     if (this.edges.length === 0) this.finishedGenerating = true;
-
   }
 
   getCellIndex(cell) {

algorithms/ModifiedPrims.js

@@ -34,7 +34,6 @@ class ModifiedPrims extends Maze {
   }
 
   takeStep() {
-
     //find index of cell with minimum cost
     let minCost = Infinity;
     let cellIndex = 0;
@@ -80,7 +79,6 @@ class ModifiedPrims extends Maze {
     }
 
     if (this.activeCells.length === 0) this.finishedGenerating = true;
-
   }
 }
 

algorithms/RecursiveDivision.js

@@ -38,7 +38,6 @@ class RecursiveDivision extends Maze {
   }
 
   takeStep() {
-
     switch (this.state) {
       case this.CHOOSE_REGION:
         this.chooseRegion();
@@ -55,7 +54,6 @@ class RecursiveDivision extends Maze {
           this.state,
         );
     }
-
   }
 
   chooseRegion() {

algorithms/Sidewinder.js

@@ -46,7 +46,6 @@ class Sidewinder extends Maze {
     if (this.currentCell.y >= this.height) {
       this.finishedGenerating = true;
     }
-
   }
 }
 

algorithms/SimplifiedPrims.js

@@ -28,7 +28,6 @@ class SimplifiedPrims extends Maze {
   }
 
   takeStep() {
-
     let cellIndex = Math.floor(this.prng.random() * this.activeCells.length);
     let cell = this.activeCells[cellIndex];
 

algorithms/TruePrims.js

@@ -3,7 +3,7 @@ import {
   dx,
   dy,
   directions,
-  opposite
+  opposite,
 } from "../directions.js";
 
 class TruePrims extends Maze {
@@ -21,13 +21,17 @@ class TruePrims extends Maze {
         for (let direction of directions) {
           let isBorderWall = !this.cellIsInMaze({
             x: x + dx[direction],
-            y: y + dy[direction]
+            y: y + dy[direction],
           });
 
           let passageCost = isBorderWall ? Infinity : this.prng.random();
 
-          if((direction === "N" || direction === "W") && !isBorderWall){
-            passageCost == this.costs[y+dy[direction]][x+dx[direction]][opposite[direction]];
+          if ((direction === "N" || direction === "W") && !isBorderWall) {
+            passageCost ==
+              this
+                .costs[y + dy[direction]][x + dx[direction]][
+                opposite[direction]
+              ];
           }
 
           this.costs[y][x][direction] = passageCost;
@@ -42,16 +46,15 @@ class TruePrims extends Maze {
       x: this.start.x,
       y: this.start.y,
     };
-    
-    for(let direction of directions){
-      this.activePassages.push({x: startCell.x, y: startCell.y, direction});
+
+    for (let direction of directions) {
+      this.activePassages.push({ x: startCell.x, y: startCell.y, direction });
     }
 
     this.visited[startCell.y][startCell.x] = true;
   }
 
   takeStep() {
-
     //find index of cell with minimum cost
     let minCost = Infinity;
     let passageIndex = 0;
@@ -68,24 +71,24 @@ class TruePrims extends Maze {
       x: passage.x + dx[passage.direction],
       y: passage.y + dy[passage.direction],
     };
-
 
     if (this.cellIsInMaze(newCell) && !this.visited[newCell.y][newCell.x] > 0) {
-
-      this.removeWall({x: passage.x, y: passage.y}, passage.direction);
+      this.removeWall({ x: passage.x, y: passage.y }, passage.direction);
       this.visited[newCell.y][newCell.x] = true;
       this.totalVisted++;
 
-      for(let direction of directions){
-        if(direction !== opposite[passage.direction]) this.activePassages.push({x: newCell.x, y: newCell.y, direction});
+      for (let direction of directions) {
+        if (direction !== opposite[passage.direction]) {
+          this.activePassages.push({ x: newCell.x, y: newCell.y, direction });
+        }
       }
-
     } else {
       this.activePassages.splice(passageIndex, 1);
     }
 
-    if (this.activePassages.length === 0 || minCost === Infinity) this.finishedGenerating = true;
-
+    if (this.activePassages.length === 0 || minCost === Infinity) {
+      this.finishedGenerating = true;
+    }
   }
 }
 

algorithms/Wilsons.js

@@ -27,7 +27,7 @@ class Wilsons extends Maze {
   }
 
   addVisit(x, y, dir = "S") {
-    console.log("🎻", x, y, dir)
+    console.log("🎻", x, y, dir);
     this.visits[`${x}:${y}`] = dir;
     this.visited[y][x]++;
   }
@@ -59,7 +59,7 @@ class Wilsons extends Maze {
       }
     }
 
-    console.log("i", i, this)
+    console.log("i", i, this);
   }
 
   walkStep() {
@@ -68,7 +68,7 @@ class Wilsons extends Maze {
       let ny = this.y + dy[direction];
 
       if (this.cellIsInMaze({ x: nx, y: ny })) {
-        console.log(67, nx, ny, JSON.stringify(this))
+        console.log(67, nx, ny, JSON.stringify(this));
 
         let x = this.x;
         let y = this.y;
@@ -106,7 +106,7 @@ class Wilsons extends Maze {
 
       console.log("🏃‍♀️", nx, ny, dir, JSON.stringify(this));
 
-      if (this.cellIsInMaze({x: nx, y: ny}) && !this.visited[ny][nx]) {
+      if (this.cellIsInMaze({ x: nx, y: ny }) && !this.visited[ny][nx]) {
         this.resetVisits();
         this.state = 1;
       }
@@ -149,7 +149,6 @@ class Wilsons extends Maze {
     }
 
     if (this.remaining === 0) this.finishedGenerating = true;
-
   }
 
   eraseLoopFrom(x, y) {