The branching scenario is a classic model for learning games. These maps make the structures of these games clear. For the most part they are just trees - one correct outcome and 15 bad outcomes. Sometimes, they contain links from one banch to another, and people taking the E-Learning 3.0 course will recognize them as DAGs (Directional Acyclic Graphs). Except for the last one, which is a time travel game, and loops back to the start, making it a cyclic graph. Via Christy Tucker.
Today: 0 Total: 389 [Direct link] [Share]
