(game "Oriath" (players 1) (equipment { (board use:Edge) }) (rules (play (move Add (to Edge (sites Empty Edge)) ) ) (end { }) ) ) //------------------------------------------------------------------------------ (option "Board" args:{ } { (item "Graph1" < (complete (regular Star 7)) > "The game is played on the Graph1." )* (item "Graph2" < (remove (complete (regular Star 8)) edges:{ {0 1} {2 3}}) > "The game is played on the Graph2." ) (item "Graph3" < (graph vertices:{ {2 0} {9 0} {6 1} {4 2} {9 2} {3 3} {0 4} {3 5} {6 3} {8 5} {11 4} {2 8} {7 7} {9 8}} edges:{ {0 1} {0 2} {0 3} {0 4} {0 5} {0 6} {0 7} {0 8} {0 9} {0 10} {0 11} {0 12} {0 13} {1 2} {1 3} {1 4} {1 5} {1 6} {1 7} {1 8} {1 9} {1 10} {1 11} {1 12} {1 13} {2 3} {2 4} {2 5} {2 6} {2 7} {2 8} {2 9} {2 10} {2 11} {2 12} {2 13} {3 4} {3 5} {3 6} {3 7} {3 8} {3 9} {3 10} {3 11} {3 12} {3 13} {4 5} {4 6} {4 7} {4 8} {4 9} {4 10} {4 11} {4 12} {4 13} {5 6} {5 7} {5 8} {5 9} {5 10} {5 11} {5 12} {5 13} {6 7} {6 8} {6 9} {6 10} {6 11} {6 12} {6 13} {7 8} {7 9} {7 10} {7 11} {7 12} {7 13} {8 9} {8 10} {8 11} {8 12} {8 13} {9 10} {9 11} {9 12} {9 13} {10 11} {10 12} {10 13} {11 12} {11 13} {12 13} } ) > "The game is played on the Graph3." ) }) (option "Version" args:{ } { (item "General" < (if (is RegularGraph Mover) (result Mover Win)) > "General version" )* (item "Parameter-k" < (if (is RegularGraph Mover k:4) (result Mover Win)) > "Parameter-k version" ) }) //------------------------------------------------------------------------------ (metadata (info { (description "Oriath is a puzzle based on the graph-theoretic concept of regular graphs. A regular graph is a graph where each vertex has the same number of neighbours; i.e. every vertex has the same degree. Moreover, if a regular graph has k degree, then it's called a k-regular graph. ") (rules "Oriath has two versions: general and parameter-k. In both versions, the graph is initially uncoloured. Player alternate taking turns, in which the current player colours an uncoloured edge. In the general version, the last player to make a move such that the coloured graph becomes a regular graph wins. For the parameter-k version, the game is won by the last player to make a move such that the coloured graph is a k-regular graph. ") (id "699") (version "1.3.12") (classification "experimental/graph theory") (author "Tahmina Begum") (credit "Tahmina Begum 25-05-2020") (date "25-05-2020") } ) (graphics { (player Colour P1 (colour 0 127 255)) (board Style PenAndPaper replaceComponentsWithFilledCells:True) (show Edges ThinDotted (colour 127 127 127)) }) (ai "Oriath_ai" ) )