64 lines
3.1 KiB
Plaintext
64 lines
3.1 KiB
Plaintext
MULTI-AGENT PROJECT:
|
|
|
|
The Agent Project is a Java implementation of Conway's Game of Life, enhanced with the introduction of agents, rules(other game modes), and additional cell types.
|
|
|
|
|
|
|
|
DEFAULT SET-UP:
|
|
-By default, the rule is set to Conway's Game of Life
|
|
-By default, the borders are Closed
|
|
-By default when you click on the grid a green cell will appear.
|
|
-By default, the grid is 100x100:
|
|
You have the possibility to change the size of the Grid where all the cells/agents will interact together.
|
|
The default setup is a grid of 100x100.
|
|
|
|
|
|
|
|
Interface Guide:
|
|
|
|
-Load World: button loads a new World by selecting a CSV file, for any cell type
|
|
-Save World: button saves the current world (for any cell type) in a CSV file.
|
|
-Load Rule: button loads the rule that you want to play with, by selecting the wanted CSV file.
|
|
-Load Agents: button loads some predefined agents on the grid, by selecting the wanted CSV file.
|
|
-Save Agents: After adding different agents on the grid, it will save their coordinates in a new CSV file.
|
|
-Random Field: The button will generate a random amount of cells on the grid depending on the rule selected.
|
|
-Toggle Border: allows the user to close or open the border of the map. An open border means that each side of the world is connected to the opposite side
|
|
-Toggle Click: button allows the user to cycle between the different cell types and agents. (hence the user can manually click on the grid and add any cells or agents)
|
|
|
|
|
|
|
|
How to play:
|
|
|
|
There are different possible game modes that can be loaded into the game. Those modes follow certain rules that will change the cell's behaviors, or type of cell displayed on the grid.
|
|
|
|
In order to modify/create a rule file, you will need to modify/create a CSV file that follows the instructions:
|
|
-Each column describes the rules applied to a specific color.
|
|
-The first row specifies the number of same-color neighbors required for a colored cell to stay alive.
|
|
-The second row specifies the number of same-color neighbors required for a non-colored cell to become alive.
|
|
|
|
Already implemented game modes:
|
|
-Default one: Conway's Game:
|
|
-Any alive cell with two or three alive neighbors survives.
|
|
-Any dead cell with exactly three alive neighbors becomes a alive cell.
|
|
-All other living cells die in the next generation, and all other dead cells stay dead.
|
|
|
|
-Multi-color Conway's Game:
|
|
-Follow Conway's rule but with more cells that each one of them follows the rule separately.
|
|
|
|
|
|
-HighLife:
|
|
-Any alive cell with two or three alive neighbors survives.
|
|
-Any dead cell with exactly three or six live neighbors becomes a alive cell.
|
|
|
|
|
|
Agents:
|
|
Agents are game entities that operate independently of the cells' interactions but may interact with them. In our version of the project, we have implemented two types of agents: a sheep and a wolf. Both agents need to eat to survive and have the ability to reproduce.
|
|
Their behaviors are as follows:
|
|
-Sheep agents can eat cells to decrease their level of hunger, they have a chance of 0.10 to reproduce themselves.
|
|
-Wolf agents eat sheep to decrease their level of hunger, they have a change of reproduction of 0.10.
|
|
|
|
|
|
|
|
|
|
|