I've been wondering about if there is an algorithm that gives an (approximately) optimal sequence of decisions that are optimal: https://github.com/void4/notes/

I've been wondering about if there is an algorithm that gives an (approximately) optimal sequence of decisions that are optimal: https://github.com/void4/notes/issues/66 https://github.com/void4/notes/issues/66 And created a site with a number of deterministic games with a limited number of steps: https://qewasd.com/ https://qewasd.com/ What is the highest/lowest value that can be reached? Which scores can be reached and which cannot? It seems to be equivalent to the halting problem. If anyone knows of a better solution than brute force, let me know!