|
Entry in Table Games for author value Tahmina Begum
Id 542 Name Wagner NativeName Description Wagner is a two-player graph theory game based on the Wagner graph, which is a Mobius ladder with 8 vertices. In this graph, the diameter and the radius are both equal to 2.
MainRuleset 614 LudiiRuleset 614 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-04-25 ProprietaryGame 0 Credit Tahmina Begum SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 546 Name MaxMatch NativeName Description MaxMatch is a 2-player game. This game is based on the principle of "matching" in graph theory. MainRuleset 618 LudiiRuleset 618 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-04-28 ProprietaryGame 0 Credit Tahmina Begum SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 547 Name Two-Colour NativeName Description Two-Colour is a 2-player graph theory game. It can be played on any graph.
MainRuleset 619 LudiiRuleset 619 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-04-28 ProprietaryGame 0 Credit Tahmina Begum SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 548 Name DisPath NativeName Description DisPath is a 2-player graph theory game, which can be played on vertices or edges of any graph. The aim of the game is to make more disjoint paths. Every disjoint path needs to be fully disconnected from any other friendly path. The length of the path can be any integer (in this game, we have used k = 3). The motivation comes from the Disjoint path problem in graph theory. MainRuleset 620 LudiiRuleset 620 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-03-30 ProprietaryGame 0 Credit Tahmina Begum SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 563 Name Ciri Amber NativeName Description Ciri Amber is a multiplayer graph theory game, which is based on the principle of regular graphs. A graph is regular if all the vertices have the same degree. MainRuleset 660 LudiiRuleset 660 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-07-01 ProprietaryGame 0 Credit Tahmina Begum SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 578 Name Onek Rong NativeName Description Onek Rong is a multiplayer graph theory game, which can be played by two or more players. It is played on an undirected and vertex-weighted graph. MainRuleset 674 LudiiRuleset 674 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-07-01 ProprietaryGame 0 Credit Tahmina Begum SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 582 Name Line and Cross NativeName Description Line and Cross is a multi-player mathematical game. MainRuleset 680 LudiiRuleset 680 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-06-22 ProprietaryGame 0 Credit Tahmina Begum 22-06-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 584 Name CrossGeo NativeName Description The game CrossGeo is a 2-player mathematical game. The game has three different versions: CrossGeo, CrossGeoR-B, and CrossGeoR-G-B. CrossGeo is the basic version, which can be played on graphs with onlu green (shared) edges. MainRuleset 682 LudiiRuleset 682 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-06-22 ProprietaryGame 0 Credit Tahmina Begum 22-06-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 589 Name Radran NativeName Description Radran is a graph theory game that uses a regular graph mechanism. A regular graph is a graph where each vertex has the same number of neighbours; i.e. every vertex has the same degree. Radran can be played on any undirected and edge-weighted graph. It can be played with two or more player. MainRuleset 691 LudiiRuleset 691 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-07-01 ProprietaryGame 0 Credit Tahmina Begum SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 592 Name Ilpion NativeName Description Ilpion is a graph theory game that uses a centroid decomposition method. It is played on an undirected and unweighted tree. The board graph is initially coloured with a common colour. MainRuleset 694 LudiiRuleset 694 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-06-01 ProprietaryGame 0 Credit Tahmina Begum 01-06-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 593 Name SpanRups NativeName Description The SpanRups is a graph theory game that uses concepts of spanning tree, and spanning caterpillar tree. A spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. The spanning caterpillar tree C is a spanning tree in which all the vertices are within distance 1 from a central path. MainRuleset 695 LudiiRuleset 695 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-05-22 ProprietaryGame 0 Credit Tahmina Begum 22-05-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 594 Name OddEvenTree NativeName Description OddEvenTree is a graph theory game. It is played on an undirected, cyclic, and edge-weighted graph. MainRuleset 696 LudiiRuleset 696 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-06-29 ProprietaryGame 0 Credit Tahmina Begum 29-06-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
Id 596 Name LastEdge NativeName Description The game LastEdge is a 2-player mathematical game. The game has three different versions: LastEdge, LastEdgeR-B, and LastEdgeR-G-B. The LastEdge is the basic version which can be played on some green (shared) edges. MainRuleset 698 LudiiRuleset 698 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-06-16 ProprietaryGame 0 Credit Tahmina Begum SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
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
Id 598 Name Windir NativeName Description Windir is a graph theory game based on the graph-theoretic concept of regular graphs. A regular graph is a graph where every vertex has the same number of neighbours; i.e. every vertex has the same degree.
MainRuleset 700 LudiiRuleset 700 Reference Origin DLPGame 0 PublicGame 1 knownAliases Author Tahmina Begum Publisher Date 2020-05-26 ProprietaryGame 0 Credit Tahmina Begum 26-05-2020 SeeAlso BGGId OriginPoint EvidenceRange 0,5520 WishlistGame 0 Notes HelpUs 0 ForceRulesetInLud 0 DisableWebApp 0
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
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
|
|