Advertisement
Published in:
2014 | OriginalPaper | Chapter
Further Investigations of 3-Member Simple Majority Voting for Chess
Authors : Kristian Toby Spoerer, Toshihisa Okaneya, Kokolo Ikeda, Hiroyuki Iida
Published in: Computers and Games
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
The 3-member simple majority voting is investigated for the game of Chess. The programs Stockfish, TogaII, andBobcat are used. Games are played against the strongest member of the group and against the group using simple majority voting. We show that the group is stronger than the strongest program. Subsequently, we investigate the research question, “under what conditions is 3-member simple majority voting stronger than the strongest member?” To answer this question we perform experiments on 27 groups. Statistics are gathered on the situations where the group outvoted the group leader. We found two conditions as an answer to the research question. First, group members should be almost equal in strength whilst still showing a small, but significant strength difference. Second, the denial percentage of the leaders candidate move depends on the strength of the members.