Skip to content

Comment on Menace: A Machine-Educable Noughts and Crosses Engine (2016)

Comments

The rules seem weird - Martin Gardner had the same matchbox self-learning robot for playing hexapawn https://en.wikipedia.org/wiki/Hexapawn It had less states so it could fit on 20+ matchboxes that were filled with candy, but the rules are: 1. If it wins, nothing is changed 2. If it loses, you take the last move that has been made that resulted in the loss, and eat the candy, thus cutting this move from the possible move graph

This way every game lost improves the engine 100%, while in this Menace example the draw introduces unnecessary noice by bringing back moves, and the punishment for a loss seems unnecessarily harsh - removing EVERY MOVE played, which may cut out the best strategy

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.