Revision as of 22:35, 8 February 2014 edit Skulldyvan (talk \| contribs) 113 edits m →Regarding Chess's game tree ← Previous edit		Revision as of 22:37, 8 February 2014 edit undo Skulldyvan (talk \| contribs) 113 edits →Regarding Chess's game tree Next edit →
Line 63: == Regarding Chess's game tree == Isn't it incorrect to call the game tree of chess finite, when at any point, the players can just keep going back and forth with a single piece? Wouldn't it be more correct to use a cyclic [[Directed ~~Acyclic~~ Graph]] for a finite representation?

Talk:Strict programming language: Difference between revisions