Editing Combinatorial game theory (section)

== Difference with traditional game theory ==
Combinatorial game theory contrasts with "traditional" or "economic" [[game theory]], which, although it can address [[Extensive-form game|sequential play]], often incorporates elements of [[probability]] and [[incomplete information]]. While economic game theory employs [[utility theory]] and equilibrium concepts, combinatorial game theory is primarily concerned with [[Two-player game|two-player]] [[Perfect-information game|perfect-information games]] and has pioneered novel techniques for analyzing [[Game tree|game trees]], such as through the use of [[Surreal number|surreal numbers]], which represent a subset of all two-player perfect-information games. The types of games studied in this field are of particular interest in areas such as [[artificial intelligence]], especially for tasks in [[automated planning]] and [[scheduling]]. However, there is a distinction in emphasis: while economic game theory tends to focus on practical algorithms—such as the [[alpha–beta pruning]] strategy commonly taught in AI courses—combinatorial game theory places greater weight on theoretical results, including the analysis of [[game complexity]] and the existence of optimal strategies through methods like the [[strategy-stealing argument]].