Tag archive
Evolved Monopoly players with a memory of past trades won 56.1% of two-against-two games against the same setup without one. A third population that barely used its one history-based input won 55.8% against the same opponents, so that margin does not show that memory helped.
The same NEAT code that split an XOR population into 13 species in ten generations kept a Monopoly population in exactly one, because a 180-gene starting genome shrank every compatibility distance to a median of 0.368 against a threshold of 3. Counting only the genes added since the start moved that median to 6.379.
I expected backpropagation to learn XOR with the least work. At learning rate 0.5 it needed 9,268 to 11,124 network runs where a random-nudge hill climber needed 1,512 to 1,648. Only on a two-output full adder did it win, needing about a third of the hill climber's work.
http://www.youtube.com/watch?v=bSC_atAilnY 在这期 Eye on AI 的播客中，主持人 Craig Smith...