User:4st/Graphomic: Difference between revisions
miraheze>4st |
miraheze>4st |
||
| Line 1: | Line 1: | ||
== Initial Ruleset == | == Initial Ruleset == | ||
=== The Graph === | === Definitions === | ||
The game is played on a matrix of discrete size. Each entity | |||
The values in the | ==== The Graph ==== | ||
The game is played on a matrix of discrete size. Each entity has a row and a column. The values in the graph can be integers from -10 to 10 inclusive, rules to the contrary notwithstanding. | |||
Each player is an entity. | |||
==== Edges ==== | |||
Each row represents the starting vertex, and each column represents the destination vertex for a connection. The value at this matrix element is the weight of the edge. A value of 0 represents no edge. | |||
(This makes the matrix representative of a weighted, directed graph: See these links for more details: | |||
https://en.wikipedia.org/wiki/Adjacency_matrix | |||
https://en.wikipedia.org/wiki/Directed_graph) | |||
==== Paths ==== | |||
A path from entity A to entity B is a list of edges where the first edge in the list has starting entity A, and the last edge in the list has destination entity B, and each edge in-between has a starting edge of the destination edge of the previous edge in the list. | |||
=== Turns === | === Turns === | ||
| Line 8: | Line 23: | ||
===Moves === | ===Moves === | ||
A move consists of a player can modifying a value in the matrix that is neither in their row or column by adding or subtracting 1 to that value, and they can do such a move so by announcement in #game-actions. | A move is one of the following actions: | ||
==== Graph Adaptation ==== | |||
A graph adaptation consists of a player can modifying a value in the matrix that is neither in their row or column by adding or subtracting 1 to that value, and they can do such a move so by announcement in #game-actions. | |||
=== Winning === | === Winning === | ||
A player wins if there is a path | A player wins if there is a path, whose edge weights sum to a positive value, from themself to each other player. | ||
== bad? ideas == | == bad? ideas (not part of initial rules, but serve to promote this initial ruleset) == | ||
=== Bonus entities === | === Bonus entities === | ||
As long as a path with total positive value exists from themself to a bonus entity, that player can make an additional move each phase. | As long as a path with total positive value exists from themself to a bonus entity, that player can make an additional move each phase. | ||
| Line 34: | Line 52: | ||
A player adds up the points when the traversal finishes, or, if a traversal would never finish due to a cycle, then -10. | A player adds up the points when the traversal finishes, or, if a traversal would never finish due to a cycle, then -10. | ||
This value is added to their score. | This value is added to their score. | ||
==== Shop ==== | |||
The shop is an entity. A player can buy items if the shop is connected to them. A player can sell items if they are connected to the shop. | |||
=== Anti-cycle laws === | |||
If, after a move, a cycle exists, all positive edges in those cycles have their value decreased by 1, and all negative edges in those cycles have their value increased by 1. | |||
=== Items === | |||
An item is stored on an entity. That entity may choose to give that item to any entity it is connected to by a path with a total positive value. | |||