algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

Enhance readability of KnightTour (#1572)

Browse Source
This commit is contained in:
Hardik Pawar
2023-10-24 12:18:13 +05:30
committed by GitHub
parent 60443c7eff
commit 7d7f109e6f
1 changed files with 9 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
Backtracking/KnightTour.js
View File

@ -2,12 +2,13 @@
class OpenKnightTour { class OpenKnightTour {
constructor(size) { constructor(size) {
// Constructor to initialize the chessboard and size
this.board = new Array(size).fill(0).map(() => new Array(size).fill(0)) this.board = new Array(size).fill(0).map(() => new Array(size).fill(0))
this.size = size this.size = size
} }
getMoves([i, j]) { getMoves([i, j]) {
// helper function to get the valid moves of the knight from the current position // Helper function to get the valid moves of the knight from the current position
const moves = [ const moves = [
[i + 2, j - 1], [i + 2, j - 1],
[i + 2, j + 1], [i + 2, j + 1],
@ -19,18 +20,19 @@ class OpenKnightTour {
[i - 1, j + 2] [i - 1, j + 2]
] ]
// Filter out moves that are within the board boundaries
return moves.filter( return moves.filter(
([y, x]) => y >= 0 && y < this.size && x >= 0 && x < this.size ([y, x]) => y >= 0 && y < this.size && x >= 0 && x < this.size
) )
} }
isComplete() { isComplete() {
// helper function to check if the board is complete // Helper function to check if the board is complete
return !this.board.map((row) => row.includes(0)).includes(true) return !this.board.map((row) => row.includes(0)).includes(true)
} }
solve() { solve() {
// function to find the solution for the given board // Function to find the solution for the given board
for (let i = 0; i < this.size; i++) { for (let i = 0; i < this.size; i++) {
for (let j = 0; j < this.size; j++) { for (let j = 0; j < this.size; j++) {
if (this.solveHelper([i, j], 0)) return true if (this.solveHelper([i, j], 0)) return true
@ -40,14 +42,15 @@ class OpenKnightTour {
} }
solveHelper([i, j], curr) { solveHelper([i, j], curr) {
// helper function for the main computation // Helper function for the main computation
if (this.isComplete()) return true if (this.isComplete()) return true
// Iterate through possible moves and attempt to fill the board
for (const [y, x] of this.getMoves([i, j])) { for (const [y, x] of this.getMoves([i, j])) {
if (this.board[y][x] === 0) { if (this.board[y][x] === 0) {
this.board[y][x] = curr + 1 this.board[y][x] = curr + 1
if (this.solveHelper([y, x], curr + 1)) return true if (this.solveHelper([y, x], curr + 1)) return true
// backtracking // Backtracking: If the solution is not found, reset the cell to 0
this.board[y][x] = 0 this.board[y][x] = 0
} }
} }
@ -55,7 +58,7 @@ class OpenKnightTour {
} }
printBoard(output = (value) => console.log(value)) { printBoard(output = (value) => console.log(value)) {
// utility function to display the board // Utility function to display the board
for (const row of this.board) { for (const row of this.board) {
let string = '' let string = ''
for (const elem of row) { for (const elem of row) {