This project represents a Prolog implementation of the classical game Zurero, which was developed in the Logic Programming class (PLOG). It features 3 different gamemodes:
- Human vs Human
- Human vs Computer
- Computer vs Computer
There are two different difficulty settings for the Computer player as well: easy and smart.
Zurero is a classical board game in which a player must align 5 of their pieces, either in a row, column or diagonaly. This can be done by "sliding" pieces from one of the board's edges. A player can only slide a piece in a row/column where there is at least another piece. When two pieces "collide", one of two scenarios can happen:
-
If the piece that was already on the board doesn't have another piece blocking its way, it slides one space in the opposite direction of the thrown piece. This last one will occupy the former place of the piece that was already on the board.
-
If the above condition fails, the thrown piece will occupy the space directly before the first piece that encountered.
During the game, a player will first have to choose if it wants to play in a column or line. After that, it will have to input the letter corresponding to the column or the line number, respectively. Next, the player will also have to indicate the direction in which it wishes to play. This could be Down (D) or Up (U) for column plays or Left (L) or Right (R) for line ones. After this, if the move is valid, it will be performed and the resultant board printed onto the screen.
If it's the computer's turn, depending on the difficulty chosen, he will choose a possible move and execute it, printing it's details on the screen as well as the resultant board.
To use this application, you must load the Zurero.pl file in a Prolog interpreting machine. After it has loaded all the other files, you can initiate the game with the 'play' command. Note: Don't forget the '.' after the command.
This application is intended to simulate the scheduling of different tasks on a certain number of servers in a single day, trying to minimize the overall time spent in the execution of these tasks. Each server has a specified number of cores and processor frequency, memory and disk space. Each task also has the the necessary values for all these parameters, as well as the:
- ETA of the task (in minutes) - This is an estimate of the time required to complete the task. Note that this can be higher or lower in reality depending on the capabilites of the processor.
- Associated client plan - This is composed of an integer between 1 and 4, with higher numbered plans having greater priority.
The servers represented here support multi-threading which means that more than one task can be running at the same time in a server, given that it has the necessary requirements for both tasks to be running simultaneously.
To initiate the application, it is necessary to first load the computing_centre.pl file in a prolog interpreting machine and then run the command 'ceco'. The user will now have the option to insert the data manually or auto generate values for the servers/tasks. For each option, the user will have to indicate the number of servers and tasks and, in the case of manual input, indicate the specs for each server and task. If these values were auto generated, they will be printed onto the screen.
After all values are set, the application will calculate and display the results like so.
