Bastet and Hatetris are two attempts at Tetris which try to choose the least useful block.
Given knowledge of the algorithm being used to select the next block, devise a best response strategy.
Game theoretically, what is the worst "most evil" block choosing algorithm? (I'm guessing UCT from Go 囲碁 will be effective.) Suppose, like Tetris, the algorithm must not only choose the current block but also commit to the preview next block. What is the worst algorithm? What is the best response? Is there Nash equilibrium? (I'm guessing not, for deterministic algorithms.) As a UI improvement, allow Undo.
Two player mode: one player plays Tetris, the other chooses blocks.
No comments :
Post a Comment