Solution for both N Queens Puzzle and Knight's Tour (with GUI)

A Java implementation of the Knight's Tour algorithm.

A complete solution with heuristic & non-heuristic ways to knights-tour problem in chess

Knight's tour algorithm for humans ♞

Visualization of the Knight's Tour move sequence

Two different methods are being utilized to solve this famous puzzle. They are backtracking and genetic algorithms. The second approach is still in development. Backtracking method seems to be faster, but GA delivers more consistent results for a diverse palette of starting positions. All in all, a very interesting project to me personally.

This repository showcases visualizations of 2 classic np-complete problems: nqueens and knight's tour.

Solving Knight's tour problem using Java

Knight's Tour Problem

Knight’s Tour is a sequence of valid moves of a knight on a chessboard in such a way that the knight covers all the squares on the board. This is a Hamiltonian path problem in computer science which is NP-complete. In this project, I compare the time complexities of Knight's Tour while implementing i) Backtracking, and ii) Warnsdorff's heuristic.

Knight's tour solution

An attempt to overcome factorization attack on RSA.

Knight's tour implemented in java using stacks and backtracking to find a single solution for 3x3 - 8x8 sized boards

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.

Knights Tour game created using Java for AP Computer Science A

Knight's Tour project for an m*n chess board in Java for Fall 2019 CS 114.