Repository for the practical work of the Algorithms and Data Structures course
- UNLaM (National University of La Matanza) -

Summary • Features • Installation • Known issues • How to play
Application structure • Team workflow • Development team • Additional material
License • Acknowledgments

[ Spanish version ]

(demonstration video)

This repository contains the practical work for the Algorithms and Data Structures course at the National University of La Matanza (UNLaM). The practical work consists of developing the Tic-Tac-Toe game using the C programming language. The main objective is to integrate the game with an API to record the results and thus improve the artificial intelligence.

• Architecture planning.
• Artificial intelligence (AI).
• Code conventions and standards.
• Code documentation using Doxygen syntax.
• Commits following the Conventional Commits.
• Communication with APIs (GET and POST).
• Continuous integration with GitHub Actions.
• Deployment of releases.
• Dynamic memory.
• Inputs control using validations.
• Local storage of records.
• Singly linked list implementation.
• Team Workflow planning (branches, tags, and releases).

1. Clone the repository to your device and install the CodeBlocks IDE with MinGW.

2. Open the files src.cbp (main project) and libs.cbp (library project) with the CodeBlocks application. These files are located within the cloned repository.

3. Select the libs.cbp project (library project) and compile it in Release mode and Debug mode.

4. Select the src.cbp project (main project), run it in Release mode, and enjoy it.

1. Start the game

   When the program starts, a menu with three options will appear.

   • [A] Play Tic-Tac-Toe: Starts a game of Tic-Tac-Toe.
   • [B] Show ranking: Displays the current ranking of the group of players.
   • [C] Exit: Ends the program.

2. Start a match

   • Players are asked to enter their names. Any number of names can be entered.
   • The play order is determined randomly and displayed on the screen.
   • Each player will be asked if they are ready to start.

3. During the match

   • Each player will play a specified number of games, defined in the configuration file.
   • In each game, it is randomly assigned whether the player will be X or O.
   • The 3x3 board will be displayed, and the player must enter the position where they want to place their symbol.
   • The AI makes its move strategically:
     • Blocks the player's victory if possible.
     • Wins if it has the opportunity.
     • Plays randomly if there are no clear moves.
   • The turn alternates between the player and the AI until someone wins or a tie is declared.

4. End of the match

   • Points are assigned for each game as follows:
     • If the player wins, they receive 3 points.
     • If a tie is declared, the player receives 2 points.
     • If the AI wins, the player loses 1 point.
   • Once all games are completed, a report is generated with:
     • Details of the games (including the final state of the board).
     • Winner of each game.
     • Total score of each player.
     • Final result indicating the players with the highest score.
   • The report is saved in a text file with the format game-report_YYYY-MM-DD-HH-mm.txt.
   • The results are sent to an API.

• If it's a draw, the player earn two points.
• If the board is filled without a winner, the result is considered a draw.
• If the player has the X form, he makes the first move else the AI.
• If the player loses, he loses three points.
• If the player wins, he earn three points.
• The AI plays with a random, blocking or winning strategy, predefined at the start of the game.
• The order of the players is random.
• The player wins if he places three of his symbols in a horizontal, vertical or diagonal line.

C-Algorithms-Practical-Work-2025/
│
├── .github/
│   └── workflows/
│       └── format-code.yml
│
├── docs/
│   ├── statics/
│   │   └── preview.png
│   │
│   └── translations/
│       ├── en/
│       │   ├── documentation.md
│       │   └── requirements.md
│       │
│       └── es/
│           ├── README.md
│           ├── documentation.md
│           └── requirements.md
│
├── libs/
│   ├── libs.cbp
│   ├── macros.h
│   ├── main.h
│   ├── structs.h
│   │
│   ├── singly-list/
│   └── time/
│
├── src/
│   ├── libcurl-x64.dll
│   ├── macros.h
│   ├── main.c
│   ├── src.cbp
│   │
│   ├── api/
│   ├── configuration/
│   ├── play/
│   ├── player/
│   ├── show-ranking/
│   └── statics/
│
├── .clang-format
├── .gitignore
├── LICENSE
└── README.md

• .github - Files related to continuous integration.

  • workflows - GitHub Actions workflows.

• docs - Files related to the application documentation.

  • statics - Static files (images, videos, diagrams, etc.).
  • translations - Translations of .md (Markdown) files.

• libs - Project containing the libraries necessary for the execution of the main application project.

  • libs.cbp - Project configuration file.

  • macros.h - File with essential project macros.

  • main.h - File indexing all .h files of the project.

  • structs.h - File with general structs declarations.

  • singly-list - Singly linked list module.

  • time - Time module.

• src - Main project of the application.

  • libcurl-x64.dll - DLL for execute CUrl.

  • macros.h - File with essential project macros.

  • main.c - Main execution file.

  • src.cbp - Project configuration file.

  • api - APIs module.

  • configuration - Configuration module.

  • play - Play module.

  • player - Player module.

  • show-ranking - Show ranking module.

  • statics - Statics module.

• .clang-format - Configuration file for the clang-format code formatting tool.

• .gitignore - Git configuration file to avoid tracking unwanted files.

• LICENSE - Project license.

• README.md - Markdown file with the general documentation for the application and repository.

%%{init: { 'logLevel': 'debug', 'theme': 'dark', 'gitGraph': {'showBranches': true, 'showCommitLabel': true, 'mainBranchName': 'Master', 'parallelCommits': true}} }%%
    gitGraph:
        commit
        commit tag: "v0.0.1"
        branch "Lopez Jorge"
        commit
        commit
        checkout Master
        branch "Parra Ignacio"
        commit
        commit
        checkout Master
        branch "Hoz Lucas"
        commit
        commit
        checkout Master
        branch "Massa Valentin"
        commit
        commit
        checkout Master
        branch "Rombola Facundo"
        commit
        commit
        checkout Master
        merge "Parra Ignacio"
        merge "Lopez Jorge"
        merge "Massa Valentin"
        merge "Hoz Lucas"
        merge "Rombola Facundo" tag: "v1.0.0"

• vMAJOR.MINOR.PATCH: This tag indicates a release of the practical work following Semantic Versioning, and will only be present in the Master branch commits.

• Master: Branch containing the development versions of the practical work, where team members will introduce new changes (commits) through pull requests.

• Hoz Lucas
• Lopez Jorge
• Massa Valentin
• Parra Ignacio

• Code documentation
• Practical work requirements

This repository is under the MIT License. For more information about what is permitted with the contents of this repository, visit choosealicense.com.

We would like to thank the teachers from the UNLaM Algorithms and Data Structures course for their support and guidance.