A Simple Puzzle

581 days ago • 10 views • wiki.secretGeek.net • wiki.secretgeek.net
In 2016 Dr Bambrick proposed the first NP-Ridiculous problem. Solving it would end up consuming the remainder of his sanity, though very little of this remained after formulating the problem.
  • paradox
  • what-should-i-do-now
  • dilemma
  • the-monkey-pirate-puzzle
  • Wikipedia: Fair Division
  • Wikipedia: Fair cake-cutting
  • Wikipedia: Prisoner's Dilemma
  • Wikipedia: Knapsack problem
  • Wikipedia: Travelling Salesman Problem (tsp)
  • Wikipedia: Byzantine Fault Tolerance
  • Wikipedia: CAP Theorem
  • Wikipedia: Karp's 21 NP-complete problems
  • Wikipedia: Dining Philosopher's Problem
  • Wikipedia: Beale Ciphers
  • Arxiv: A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
  • How to Cut Cake Fairly and Finally Eat It Too
  • Einstein Quiz (plutonian whistling cat)
  • Optimization Problems in the Theory of Continuous Trading
  • Wikipedia: The Hardest Logic Puzzle Ever
  • Even Harder than 'The Hardest Logic Puzzle Ever'
  • Wikipedia: Big O Notation
  • Wikipedia: 68HC11 Microcontroller
  • Wikipedia: Unreliable Narrator
  • Wikipedia: Knights and Knaves
  • Wikipedia: Instant Insanity (puzzle)
  • ⭐ Dilemma
  • ⭐ Paradox
  • ⭐ in-a-darkened-room
  • ⭐ The-Monkey-Pirate-Puzzle

#