- Project name: C-Note
- Short description: Solving a decision problem using restriction programming, with SICStus' CLPFD library, namely solving the puzzle C-Note
- Environment: Prolog
- Tools: SICStus Prolog, CLPFD
- Institution: FEUP
- Course: PLOG (Logic Programming)
- Project grade: 17.6/20
- Group members:
After cloning the project, open a SICStus terminal, navigate to File and hit Consult, then choose the file cnote.pl. The predicate cnote. starts the program.
The main menu presents the following options:
/$$$$$$ /$$ /$$ /$$$$$$ /$$$$$$$$ /$$$$$$$$
/$$__ $$ | $$$ | $$ /$$__ $$|__ $$__/| $$_____/
| $$ \__/ | $$$$| $$| $$ \ $$ | $$ | $$
| $$ /$$$$$$ | $$ $$ $$| $$ | $$ | $$ | $$$$$
| $$ |______/ | $$ $$$$| $$ | $$ | $$ | $$__/
| $$ $$ | $$\ $$$| $$ | $$ | $$ | $$
| $$$$$$/ | $$ \ $$| $$$$$$/ | $$ | $$$$$$$$
\______/ |__/ \__/ \______/ |__/ |________/
1. Solve input puzzle <--- Input existing puzzle (examples in the game's web page)
2. Generate puzzle <--- Generate a random puzzle
3. Generate puzzle with unique solution <--- Generate a puzzle that only has one possible solution
0. Exit