Word Mutations

A GUI-based word-transformation solver implemented in C. This project demonstrates advanced algorithmic techniques and optimization strategies for solving complex graph-search problems.

Key Features:

• Graph-search solver with Dijkstra, with a lazy and an A* variants for optimal pathfinding
• Multiple optimization modes (0 to 3) with mode comparison tools
• Benchmark runner for batch evaluation on test sets
• Output logging for reproducible comparisons
• Interactive GUI interface for visualization

The project was developed for the course of algorithms and data structures, with a focus on performance optimization and practical implementation. I recently added a GUI interface to allow benchmarking of the different algorithms more easily.