In this repository there are two directories, each with the goal of introducing different programming paradigms: recursion and symbolic processing with LISP, and declarative logic programming with PROLOG.
The aim of this project is to generate random mazes and allow their interactive exploration using pure LISP with XLISP-PLUS. The maze is generated recursively using a depth-first search (DFS) algorithm, and saved to a file in a textual format. The second part consists in reading that maze from the file and letting a player navigate through it, with keyboard-based input and real-time rendering using the LISP graphics window. It emphasizes functional programming, recursion, and immutability.
This project focuses on solving nonograms, a type of logic puzzle, using declarative programming in PROLOG. The objective is to implement a predicate that finds a valid binary matrix configuration that satisfies the constraints defined by sequences of filled cells in each row and column. Optional extensions include supporting rectangular boards, generating random nonograms, and adding features like pretty-printing or color support. The project explores constraint satisfaction, unification, and logic inference mechanisms in PROLOG.
Developed by Harpo Joan & Marc Ferrer.
This repository is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright (c) 2025 Marc Ferrer & Harpo Joan