Exploring graph theory and exhaustive search
This project aims to solve crossword puzzles using exhaustive search. The puzzle is randomly generated and presented in the form of a graph. Sequences of vertices (letters) are then examined to check if the word they form is included in a dictionary. If a sequene is found in the dictionary, it is linked and coloured according to its direction. This is done using some graph and matrix manipulations adn the search is done backward as well as forward.
Because the grid is randomly generated, words found are likely to be 5 letters long or less. However, for an actual crossword puzzle that wouldn't be the case.
What will QOL look like in the future?
QUBGrid is an open-sourced Mathematica-based application for Queen's University Belfast students. The project was inspired by a plaque created by Jon McLoone. Feel free to contribute to it! QUBGrid is freely available on Github, under the GNU General Public License.
DISCLAIMER: QUBGrid is not officially approved by Queen's University Belfast and is intended for personal use only.