HOW DIFFICULT IS IT TO INVENT A NONTRIVIAL GAME?

DOI10.1080/01969729408902346MaRDI QIDQ4840233zbMATH OpenOpenAlexFDO

Authors

Publication date 24 July 1995

Published in Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01969729408902346

zbMATH Keywords

nontrivial game

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Complexity, appeal and challenges of combinatorial games
• Games, puzzles, and computation
• Gaming is a hard job, but someone has to do it!
• Threes!, Fives, 1024!, and 2048 are hard
• Threes!, Fives, 1024!, and 2048 are hard

Cites work

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 16392 (Why is no real title available?)
• A formal theory of inductive inference. Part I
• Randomness conservation inequalities; information and independence in mathematical theories

This page was built for publication: HOW DIFFICULT IS IT TO INVENT A NONTRIVIAL GAME?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840233)