RoarkJr.
Well-Known Member
“As reported by the MIT Technology Review, a new proof shows that optimal play in Magic: The Gathering is so difficult that a computer would be unable to figure out the winner, offering lasting implications for the field of game theory.”
As a lifelong magic the gathering player this is pretty cool to see. For those not familiar with the game I liken (very broadly) to a mix of poker and chess. Somewhat like chess in that there are defined parameters for what a turn looks like and for what certain cards can do, and like poker in the sense that there are variance/bluffing factors.
I recently discovered that a magic Hall of Famer was also a Brazilian jujitsu guy. A Brazilian jujitsu guy who was also a Hornet pilot told Me how similar flying and BJJ were, which got me thinking about the game. It seems like when it comes to optimizing high-performance in extremely complex environments there’s a lot of overlap in general concepts, e.g., “flow.”
Anyway, I thought I would post to either connect with fellow enthusiasts and/or generate discussion.