Knights Tour Problem — Portfolio Project by Muhammad Daffa Ashdaqfillah

A sophisticated Flask-based web application that tackles the classic Knights Tour problem in graph theory. The application implements algorithms to find both open and closed knight's tours on a chessboard, providing visual representations of the solutions and step-by-step explanations. Additionally, the application solves the Largest Increasing Subsequence problem, a fundamental concept in computer science. This project demonstrates a strong understanding of graph theory, algorithm design, and web development using Flask.

Largest Increasing Subsequence find the longest path in the graph

From last visited node, knight not go back to the starting node

From last visited node, knight go back to the starting node