Tech
Show HN: Searching for optimal strategies in a puzzle game with chance (Drop7)
Sixteen years ago, I wrote a Java program which tried to pick the ideal move in a puzzle game called Drop7. On each turn, the player only has seven choices for their next move, but there is also an element of chance which turns this simple game into a surprisingly difficult problem involving search, hidden information, long-term planning, and chance. I renewed my investigation this weekend, into whether there is an autonomous strategy that averages more than one million points per game. An exper...
Read the full discussion on HackerNews
This article was aggregated from HackerNews. Click to join the conversation.
View on HackerNews