Making change in 2048

DOI10.4230/LIPICS.FUN.2018.21zbMATH Open1491.91042arXiv1804.07396MaRDI QIDQ3301008FDOQ3301008

David Eppstein

Publication date: 11 August 2020

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

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

zbMATH Keywords

greedy algorithminteger sequenceshalting problemchange-making problem2048

Mathematics Subject Classification ID

Algorithmic game theory and complexity (91A68)

Cites Work

• Introduction to algorithms.
• Combinatorics of the change-making problem
• Optimal bounds for the change-making problem
• A polynomial-time algorithm for the change-making problem
• When the Greedy Solution Solves a Class of Knapsack Problems
• PRACTICAL NUMBERS AND THE DISTRIBUTION OF DIVISORS
• Sums of Distinct Divisors
• 8th international conference on fun with algorithms, FUN 2016, La Maddalena, Italy, June 8--10, 2016. Proceedings
• On an arithmetic function considered by Pillai
• Title not available (Why is that?)
• Totally greedy coin sets and greedy obstructions
• Sur une propriété des nombres naturels
• Title not available (Why is that?)
• On two conjectures about practical numbers
• Systematic selection of \(N\)-tuple networks for 2048

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)