9th Mar '17 10:52:32 AM

**Jan_z_Michal** Is there an issue? Send a Message

**Added DiffLines:**

** ''GameBreaker/ArcanumOfSteamworksAndMagickObscura''

17th Feb '17 11:03:12 AM

**crazyrabbits** Is there an issue? Send a Message

13th Feb '17 3:04:49 AM

**YZQ** Is there an issue? Send a Message

** ''GameBreaker/CallOfDuty''

**Changed line(s) 64 (click to see context) from:**

** ''GameBreaker/CallOfDuty''

**to:**

**Deleted line(s) 82 (click to see context) :**

** ''GameBreaker/TotalWar''

**Added DiffLines:**

** ''GameBreaker/TotalWar''

13th Feb '17 2:50:46 AM

**YZQ** Is there an issue? Send a Message

**Changed line(s) 45 (click to see context) from:**

*** The chessboard is not symmetrical, and there is a difference between moving the king's bishop's pawn one square and the queen's bishop's pawn one square. White has 8 distinct pawns that can move to one of two squares and two knights that also could move to two different squares each, for a total of 20 possible initial moves. Black has the same options, for another 20 distinct responses. That's four hundred possible states for the game after both players have had their first turn: after both players have had two turns there are 197,742 possible states, and after three, 121,000,000. While the number of valid moves a player could make in chess is always in flux, they never are equivalent, so a computer trying to solve chess via a brute force search encounters a staggeringly large number of possible games. The lower bound of possible games is usually given as the Shannon Number (a number that estimates the lowest possible right answer for "How many games of chess are possible?") This number is 10^120 - a googol followed by twenty more zeros. For comparon, it is estimate that there are 10^78-10^83 atoms in the ''entire observable universe''. That's why no computer as of 2016 can solve chess via a brute force search. The numbers for go are even more staggering.

**to:**

*** The chessboard is not symmetrical, and there is a difference between moving the king's bishop's pawn one square and the queen's bishop's pawn one square. White has 8 distinct pawns that can move to one of two squares and two knights that also could move to two different squares each, for a total of 20 possible initial moves. Black has the same options, for another 20 distinct responses. That's four hundred possible states for the game after both players have had their first turn: after both players have had two turns there are 197,742 possible states, and after three, 121,000,000. While the number of valid moves a player could make in chess is always in flux, they never are equivalent, so a computer trying to solve chess via a brute force search encounters a staggeringly large number of possible games. The lower bound of possible games is usually given as the Shannon Number (a number that estimates the lowest possible right answer for "How many games of chess are possible?") This number is 10^120 - a googol followed by twenty more zeros. For ~~comparon, ~~comparison, it is ~~estimate ~~estimated that there are 10^78-10^83 atoms in the ''entire observable universe''. That's why no computer as of 2016 can solve chess via a brute force search. The numbers for ~~go ~~Go are even more staggering.

**Deleted line(s) 66 (click to see context) :**

** ''GameBreaker/WorldOfWarcraft''

** ''GameBreaker/HeroesOfTheStorm''

**Changed line(s) 69 (click to see context) from:**

** ''GameBreaker/HeroesOfTheStorm''

**to:**

** ~~''GameBreaker/HeroesOfTheStorm''~~''GameBreaker/WorldOfWarcraft''

12th Feb '17 4:41:37 AM

**YZQ** Is there an issue? Send a Message

12th Feb '17 4:35:48 AM

**YZQ** Is there an issue? Send a Message

**Added DiffLines:**

** ''GameBreaker/HeroesOfTheStorm''

31st Jan '17 8:40:17 AM

**garthvader** Is there an issue? Send a Message

**Changed line(s) 45 (click to see context) from:**

*** The chessboard is not symmetrical, and there is a difference between moving the king's bishop's pawn one square and the queen's bishop's pawn one square. White has 8 distinct pawns that can move to one of two squares and two knights that also could move to two different squares each, for a total of 20 possible initial moves. Black has the same options, for another 20 distinct responses. That's four hundred possible states for the game after two turns. While the number of valid moves a player could make in chess is always in flux, they never are equivalent, so a computer trying to solve chess via a brute force search encounters a staggeringly large number of possible games. The lower bound of possible games is usually given as the Shannon Number (a number that estimates the lowest possible right answer for "How many games of chess are possible?") This number is 10^120 - a googol followed by twenty more zeros. That's why no computer as of 2016 can solve chess via a brute force search. The numbers for go are even more staggering.

**to:**

*** The chessboard is not symmetrical, and there is a difference between moving the king's bishop's pawn one square and the queen's bishop's pawn one square. White has 8 distinct pawns that can move to one of two squares and two knights that also could move to two different squares each, for a total of 20 possible initial moves. Black has the same options, for another 20 distinct responses. That's four hundred possible states for the game after both players have had their first turn: after both players have had two ~~turns.~~turns there are 197,742 possible states, and after three, 121,000,000. While the number of valid moves a player could make in chess is always in flux, they never are equivalent, so a computer trying to solve chess via a brute force search encounters a staggeringly large number of possible games. The lower bound of possible games is usually given as the Shannon Number (a number that estimates the lowest possible right answer for "How many games of chess are possible?") This number is 10^120 - a googol followed by twenty more zeros. For comparon, it is estimate that there are 10^78-10^83 atoms in the ''entire observable universe''. That's why no computer as of 2016 can solve chess via a brute force search. The numbers for go are even more staggering.

31st Jan '17 8:35:50 AM

**garthvader** Is there an issue? Send a Message

**Changed line(s) 40 (click to see context) from:**

** Chess and Go, [[SmartPeoplePlayChess the quintessential games for geniuses]], are both theoretically solvable for a sufficiently advanced computer, as both games have a finite board and no random elements -- though a computer powerful enough to perform the necessary calculations would be many orders of magnitude better than anything available with our current level of technology (the high branching factor in Go makes it intractable to analyze with the methods used for Chess, since you rapidly get too many options to explore via lookahead in any reasonable timeframe, with no obvious way of pruning 'bad' choices quickly). For a hypothetical intelligence far beyond our capacities, Chess and Go are as trivial as Tic-Tac-Toe, but no human creation as of 2016 - not even Deep Blue - is even close to having such a level of computational power. For some perspective, there are more [[http://www.chess.com/blog/Billy_Junior/number-of-possible-chess-games?_domain=old_blog_host&_parent=old_frontend_blog_view possible chess games]] than we estimate there are [[http://www.universetoday.com/36302/atoms-in-the-universe/ atoms in the observable universe]].

**to:**

** Chess and Go, [[SmartPeoplePlayChess the quintessential games for geniuses]], are both theoretically solvable for a sufficiently advanced computer, as both games have a finite board and no random elements -- though a computer powerful enough to perform the necessary calculations would be many orders of magnitude better than anything available with our current level of technology (the high branching factor in Go makes it intractable to analyze with the methods used for Chess, since you rapidly get too many options to explore via lookahead in any reasonable timeframe, with no obvious way of pruning 'bad' choices ~~quickly).~~quickly, and even chess has more possible games than there are atoms in the universe). For a hypothetical intelligence far beyond our capacities, Chess and Go are as trivial as Tic-Tac-Toe, but no human creation as of 2016 - not even Deep Blue - is even close to having such a level of computational power. For some perspective, there are more [[http://www.chess.com/blog/Billy_Junior/number-of-possible-chess-games?_domain=old_blog_host&_parent=old_frontend_blog_view possible chess games]] than we estimate there are [[http://www.universetoday.com/36302/atoms-in-the-universe/ atoms in the observable universe]].

8th Jan '17 5:06:53 AM

**justanid** Is there an issue? Send a Message

**Changed line(s) 35 (click to see context) from:**

[[AC:Universal]]

**to:**

[[folder:Universal]]

**Changed line(s) 45 (click to see context) from:**

**to:**

[[/folder]]

3rd Jan '17 1:43:00 PM

**DastardlyDemolition** Is there an issue? Send a Message

**Changed line(s) 107 (click to see context) from:**

* [=GameBreaker/StealthBasedGame=]

**to:**

* ~~[=GameBreaker/StealthBasedGame=]~~Stealth Based Game

This list shows the last 10 events of 98. Show all.