[Welcome to Sensei's Library!]

StartingPoints
ReferenceSection
About


Aliases (info)
DAG

Referenced by
KGSWishlistGameHa...
WhitherJoseki
AdvertisingOnSLDi...
Cycle

Homepages
Axd
HuOfKGS

 

Directed Acyclic Graph
    Keywords: Theory

Sequences of Go moves, especially including variations and branches of lines of play, form tree structures. When the nodes of the trees form identical positions (so transposition has occurred) the branches of the tree can be united, forming a Directed Acyclic Graph (DAG). Trees are a subset of DAGs. The graphs are directed because there is a sense of forwardness as more moves are played. They are acyclic because positions can't repeat in most rule sets according to Super-Ko rules (Ko Rules).


Charles Matthews: In cyclic positions taxonomy the consequences of dropping the 'acyclic' condition, for local positions on a sub-board, are explored mathematically.

This is intended as as systematic way forward through the many ko-like positions.

I proposed there that one should identify the nodes of the 'best' DAG underlying a cyclic position as levels of the corresponding ko-like phenomenon. -- Charles



This is a copy of the living page "Directed Acyclic Graph" at Sensei's Library.
(OC) 2004 the Authors, published under the OpenContent License V1.0.