Java Exercices
-
Updated
Oct 13, 2017 - Java
Java Exercices
A recursive and backtracking algorithm implemented in Java for solving the Knight's Tour problem.
IT485 Logic of Inference Project on Knight's Tour. A hamiltonian path problem to determine path of knight to travel entire chessboard with every cell visited only once.
Knights Tour game
PHP study of the knight's tour problem
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.
An online Knight's tour visualizer using divide and conquer algorithm
A program written in dotty to calculate a piece's tour on a 10*10 chessboard
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.
🐴 A visualization of Warnsdorff’s Algorithm for the Knights Tour problem
Knight's tour problem solved using recursion and backtracking
This program allows you to play the knight's tour puzzle yourself or find the solution for custom board sizes.
Spring Boot REST API + React UI
Knight's tour algorithm for humans ♞
Visualize a knight's tour (ft. Warnsdorff's algorithm).
general repository for all sorts of code that I want to share with the world.
Add a description, image, and links to the knights-tour topic page so that developers can more easily learn about it.
To associate your repository with the knights-tour topic, visit your repo's landing page and select "manage topics."