更改

删除17字节 、 2020年10月25日 (日) 22:44
无编辑摘要
第19行: 第19行:  
Combinatorial games include well-known games such as [[chess]], [[Draughts|checkers]], and [[Go (board game)|Go]], which are regarded as non-trivial, and [[tic-tac-toe]], which is considered as trivial in the sense of being "easy to solve". Some combinatorial games may also have an [[Bounded set|unbounded]] playing area, such as [[infinite chess]]. In CGT, the moves in these and other games are represented as a [[game tree]].   
 
Combinatorial games include well-known games such as [[chess]], [[Draughts|checkers]], and [[Go (board game)|Go]], which are regarded as non-trivial, and [[tic-tac-toe]], which is considered as trivial in the sense of being "easy to solve". Some combinatorial games may also have an [[Bounded set|unbounded]] playing area, such as [[infinite chess]]. In CGT, the moves in these and other games are represented as a [[game tree]].   
   −
Combinatorial games include well-known games such as chess, checkers, and Go, which are regarded as ’’’<font color=“#32CD32”> non-trivial </font>’’’, and tic-tac-toe, which is considered as trivial in the sense of being "easy to solve". Some combinatorial games may also have an unbounded playing area, such as infinite chess. In CGT, the moves in these and other games are represented as a game tree.   
+
Combinatorial games include well-known games such as chess, checkers, and Go, which are regarded as  
 +
’’’<font color=“#32CD32”> non-trivial </font>’’’, and tic-tac-toe, which is considered as trivial in the sense of being "easy to solve". Some combinatorial games may also have an unbounded playing area, such as infinite chess. In CGT, the moves in these and other games are represented as a game tree.   
   −
组合游戏包括众所周知的游戏,如国际象棋、跳棋、围棋等,这些游戏被认为是’’’<font color=“#32CD32”> 非琐碎的 </font>’’’,而井字棋则被认为是 "容易解决 "的琐碎游戏。一些组合游戏也可能有一个无限制的游戏区域,如无限棋。在CGT中,这些游戏和其他游戏中的棋步被表示为博弈树。  
+
组合游戏包括众所周知的游戏,如国际象棋、跳棋、围棋等,这些游戏被认为是<font color=“#32CD32”> 非琐碎的 </font>,而井字棋则被认为是 "容易解决 "的琐碎游戏。一些组合游戏也可能有一个无限制的游戏区域,如无限棋。在CGT中,这些游戏和其他游戏中的棋步被表示为博弈树。  
     
90

个编辑