Continue from last post about NP-Problem. Today, I amÂ going to study a planning puzzle which is a type of NP-problem.
In fact, planning problems are NP-Hard (Scary).
Disclaimer: This post is for self-study and for research purposes only. I reuse some of the content from third party website (the Bus-Driver-Planning Puzzle). If it caused any unintended troubles to whatever party, please leave comment below and I will remove the post. Continue reading
Once upon a time, there was a chocolate factory. It produced chocolate bars which were sold all over the world. The proprietor of the factory hid a handful of Golden Tickets in some of the chocolate bars. For those who were lucky to find the Golden Ticket could have a tour to the mysterious factory and a lifetime supply of confectionery.
A poor young boy, Charlie, dreamed of visiting the chocolate factory and was eager to find that Golden Ticket. The chance of him getting the ticket was slim. What should he do? He could buy up as many of the chocolate bars as he could. He could try using a magnet, but gold is not magnetic. Continue reading