Enumerating moves in the optimal solution of the Tower of Hanoi.
Hacène BelbachirEl-Mehdi MehiriPublished in: CoRR (2022)
Keyphrases
- optimal solution
- np hard
- objective function
- knapsack problem
- feasible solution
- linear program
- search space
- linear programming
- global optimum
- total cost
- lower bound
- column generation
- iterative procedure
- branch and bound algorithm
- branch and bound
- solution quality
- metaheuristic
- approximate solutions
- obtain the optimal solution
- artificial intelligence
- video sequences
- reinforcement learning
- case study
- computer vision