There are 2 repositories under knight-problem topic.
Implementation Of Knight Tour Problem Using Neural Networks
Solution for both N Queens Puzzle and Knight's Tour (with GUI)
Knight's Tour puzzle 4x8 solver in JavaScript
A complete solution with heuristic & non-heuristic ways to knights-tour problem in chess
Knight's tour algorithm for humans ♞
Game of Knights where 6 knights should hit the one at their left with a random amount of damage of a range. Then they should fight until there's only one knight standing. All actions should be displayed (knight 1 hits 2 with X damage, knight 4 dies, knight 5 wins)
Implementation Of Knight Tour Problem Using Warnsdroff Rule
Knight's Tour Problem
A simple program that implements and visualizes Warnsdoff's algorthim for the Knight Tour.
Shortest path for a knight chessman.
Simple script to show horse - knights tour
Solution of various problems that can be only solved with backtracking.
Resloving chess knight shortest path problem with BFS (Breadth-first search) algorithm in swift
A knight's tour (HorseRPG) is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once.
Knight's Tour: Evolutionary & repair algorithm
Knight's Tour Problem
Terminal-based mapping tool for exploring movement vectors in a 2d grid
Heuristic and Non-Intelligent algorithm implementation to deal with Knight Tour Problem in C#/Windows Forms
Python implementation of the Knight's Tour problem with graphical interface using Tkinter
This repository contains my solution of the Knight Puzzle—a challenging puzzle in which eight knights are placed on a 3x3 chessboard with one empty square. The goal is to rearrange the knights into a specific ordered configuration by making valid knight moves while following the rules of chess.
This is a C++ Terminal based game where 2 players go against each other to reach the target on chessboard using knight in minimum moves.
Polytree and binary search trees, get a knight from starting point to end point on chess board
In a chessboard what is the Knight's minimum number of steps to reach a position
Given a chess board setup up with initial knight position and destination, it finds the shortest path (minimum number of steps) for the knight to another position (destination) on the board.
Find all the possible places on a chessborad where the Knight can move. [Dublin Assignment 2]
Display the shortest path for reaching a point(x,y) in an infinitie chess board, stimulating the 'Knight' moves, using graph theory and BFS.