stackyFACTSSometimes academic dedication borders on absolute madness.
Sometimes academic dedication borders on absolute madness. A team of computer scientists at the University of Alberta spent nearly two decades calculating all 500 billion billion possible board positions in the game of checkers just to solve it completely. After utilizing massive supercomputers, they definitively proved that if neither player makes a mistake, the game is physically incapable of producing a winner. Riveting stuff.
Keep exploring facts in this topic.
Games →STACKY FOR IPHONEKeep discovering with Stacky. Interesting facts in an app that is always within reach.
Unlike international versions where crowned pieces zip across the board like fighter jets, standard American rules keep them heavily restricted. They can…
Discover more
While it looks like a simple pastime for children, those alternating colored squares hold an astronomical amount of varying possibilities. It took advanced…
Discover more
When you cannot be bothered to learn what a knight does, jumping simple red and black discs is the perfect alternative. It requires zero setup and ends…
Discover more
You cannot play a peaceful, pacifist round. If an enemy token is exposed diagonally in front of yours with an empty space behind it, the official guidelines…
Discover more
Manually animating every single footstep on a rocky mountain is impossible. Instead, inverse kinematics dynamically calculate how joints should bend in real…
Discover more
In 2007, computer scientists mathematically 'solved' the game of Checkers. What did they find?
Discover more