PyGame | A*, Bellman-Ford, BFS, DFS, Dijkstra's, Greedy Best First Search, IDS, UCS
A 2D path-finding visualizer implemented in several algorithms (A*, Bellman-Ford, Breadth-First Search, Depth-First Search, Dijkstra's, Greedy Best First Search, Iterative Deepening Search, Uniform Cost Search);
PyGame | Minimax Algorithm
Classic Tic-Tac-Toe game featuring an AI on Minimax algorithm;
Pygame | Constraint Propagation & Backtracking algorithm
A sudoku game implemented with a solver using constraint propagation and backtracking algorithm; Strategies used include hidden singles, hidden pairs, hidden triples, naked pairs, naked triples, pointing pairs and triples, and box line reduction;
Pygame | Greedy Best-First Search, A*
An implementation of Eight Puzzle game; Extendable to larger puzzle sizes such as Fifteen Puzzle;
Pygame | Recursion & Iterative Solution
A Tower of Hanoi puzzle game with solver implemented with recursion and iterative solution;
Arc-consistency & Backtracking algorithm
A program that solves a given Killer Sudoku board using Arc-consistency plus Backtracking Algorithm;
Trie
A program that searches for words from a given pool of letters in the form of a text file; This utilizes the use of Trie data structure in storing a given set of valid words;
Z3 | Numpy | Itertools
A program that solves an N-Queens problem of any given board size; The problem is treated as a Constraint Satisfaction Problem (CSP) and is solved with Z3 Solver;
None/Minor Libraries Involved
A program that lists the cluster-cubes belonging to a certain grain ID; This 3-Dimensional data is stored in a nested list; The cluster search is implemented in a nested loop with a designed mathematical formula;
HTML | DFS
A program that generates a nested HTML list elements from a given list structure using DFS algorithm;
Recursion
A program that recursively balances the weights of a set of cryptocurrencies while not exceeding the weight-capping;