|
Ludii Portal
Home of the Ludii General Game System
|
|
|
|
|
Entry in Table Games for credit value Tahmina Begum 25-05-2020
Id 597 Name Oriath NativeName 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. MainRuleset 699 LudiiRuleset 699 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-05-25 ProprietaryGame 0 Credit Tahmina Begum 25-05-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0 ReconstructionDescriptionDone 0 SwedishDescription Oriath är ett pussel baserat på det grafteoretiska konceptet med vanliga grafer. En vanlig graf är en graf där varje vertex har samma antal grannar; dvs varje vertex har samma grad. Dessutom, om en vanlig graf har k grad, så kallas den en k-reguljär graf.
Id 599 Name Nedilmarth NativeName Description Nedilmarth is a graph theory game. It is a game for two players on an undirected cyclic graph. MainRuleset 701 LudiiRuleset 701 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-05-25 ProprietaryGame 0 Credit Tahmina Begum 25-05-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0 ReconstructionDescriptionDone 0 SwedishDescription Nedilmarth är ett grafteorispel. Det är ett spel för två spelare på en oriktad cyklisk graf.
Id 600 Name Nein Ari NativeName Description Nein Ari is a puzzle based on the graph theory concept of k-regular graphs. A k-regular graph is a graph where every vertex has exactly k neighbours (i.e. every vertex has a degree of k). MainRuleset 702 LudiiRuleset 702 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-05-25 ProprietaryGame 0 Credit Tahmina Begum 25-05-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0 ReconstructionDescriptionDone 0 SwedishDescription Nein Ari är ett pussel baserat på grafteorikonceptet för k-reguljära grafer. En k-regelbunden graf är en graf där varje vertex har exakt k grannar (dvs varje vertex har en grad av k).
|
|
|