Making change in 2048

DOI10.4230/LIPICS.FUN.2018.21MaRDI QIDQ3301008zbMATH OpenFDO

Authors David Eppstein

Publication date 11 August 2020

Full work available at URL https://arxiv.org/abs/1804.07396

zbMATH Keywords

greedy algorithminteger sequenceshalting problemchange-making problem2048

Mathematics Subject Classification ID

Algorithmic game theory and complexity (91A68)

Recommendations

• 2048 without new tiles is still hard
• Threes!, Fives, 1024!, and 2048 are hard
• Threes!, Fives, 1024!, and 2048 are hard
• Deterministic Zeckendorf games
• Systematic selection of \(N\)-tuple networks for 2048

Cites work

• 2048 without new tiles is still hard
• 8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8--10, 2016. Proceedings
• A polynomial-time algorithm for the change-making problem
• Algorithm design and applications
• Combinatorics of the change-making problem
• Introduction to algorithms.
• On an arithmetic function considered by Pillai
• On two conjectures about practical numbers
• Optimal bounds for the change-making problem
• Practical numbers and the distribution of divisors
• Sums of Distinct Divisors
• Sur une propriété des nombres naturels
• Systematic selection of \(N\)-tuple networks for 2048
• Totally greedy coin sets and greedy obstructions
• When the Greedy Solution Solves a Class of Knapsack Problems

Cited in

(2)

• Systematic selection of \(N\)-tuple networks for 2048
• 2048 without new tiles is still hard

Describes a project that uses

Uses Software

• Numberwang

This page was built for publication: Making change in 2048

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