Combinatorial game theory | Wikipedia audio article
Channel: wikipedia tts
Date: 2018-12-27

This is an audio version of the Wikipedia Article:
https://en.wikipedia.org/wiki/Combinatorial_game_theory


00:04:22 1 History
00:06:34 2 Examples
00:09:09 3 Overview
00:11:50 4 Game abbreviations
00:11:59 4.1 Numbers
00:12:27 4.2 Star
00:12:41 4.3 Up
00:13:04 4.4 Down
00:13:07 4.5 "Hot" games
00:13:30 5 Nimbers
00:13:59 6 See also
00:14:08 7 Notes
00:14:26 8 References
00:14:37 9 External links
00:14:46 Down, written as ↓, is a position in combinatorial game theory. In standard notation, ↓
00:15:04 ↑ (up)Down is strictly negative (↓  0), but is infinitesimal. Down is defined in Winning Ways for your Mathematical Plays.
00:15:09 "Hot" games
00:15:19 Consider the game {1|-1}. Both moves in this game are an advantage for the player who makes them; so the game is said to be "hot;" it is greater than any number less than -1, less than any number greater than 1, and fuzzy with any number in between. It is written as ±1. It can be added to numbers, or multiplied by positive ones, in the expected fashion; for example, 4 ± 1
00:15:59 Nimbers
00:17:01 See also



Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.

Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain

Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.

Listen on Google Assistant through Extra Audio:
https://assistant.google.com/services/invoke/uid/0000001a130b3f91
Other Wikipedia audio articles at:
https://www.youtube.com/results?search_query=wikipedia+tts
Upload your own Wikipedia articles through:
https://github.com/nodef/wikipedia-tts
Speaking Rate: 0.9678935050284831
Voice name: en-US-Wavenet-F


"I cannot teach anybody anything, I can only make them think."
- Socrates


SUMMARY
=======
Combinatorial game theory (CGT) is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information. Study has been largely confined to two-player games that have a position in which the players take turns changing in defined ways or moves to achieve a defined winning condition. CGT has not traditionally studied games of chance or those that use imperfect or incomplete information, favoring games that offer perfect information in which the state of the game and the set of available moves is always known by both players. However, as mathematical techniques advance, the types of game that can be mathematically analyzed expands, thus the boundaries of the field are ever changing. Scholars will generally define what they mean by a "game" at the beginning of a paper, and these definitions often vary as they are specific to the game being analyzed and are not meant to represent the entire scope of the field.
Combinatorial games include well-known games such as chess, checkers, and 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 unbounded playing area, such as infinite chess. In CGT, the moves in these and other games are represented as a game tree.  
Combinatorial games also include one-player combinatorial puzzles such as Sudoku, and no-player automata, such as Conway's Game of Life, (although in the strictest definition, "games" can be said to require more than one participant, thus the designations of "puzzle" and "automata".) 
Game theory in general includes games of chance, games of imperfect knowledge, and games in which players can move simultaneously, and they tend to represent real-life decision making situations.
CGT has a different emphasis than "traditional" or "economic" game theory, which was initially developed to study games with simple combinatorial structure, but with elements of chance (although it also considers sequential moves, see extensive-form game). Essentially, CGT has contributed new methods for analyzing game trees, for example using surreal numbers, which are a subclass of all two-player perfect-information games. The type of games studied by CGT is also of interest in artificial intelligence, particularly for automated planning and scheduling. In CGT there has been less emphasis on refining practical search algorithms (such as the alpha–beta pruning heuristic included in most artificial intelligence textbooks), but more emphasis on descriptive theoretical results (such as measures of game complexity or proofs of optimal solution existence without necessarily specifying an algorithm, such as the strategy-stealin ...