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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cook, D.: A human-computer team experiment for 9x9 go. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 145–155. Springer, Heidelberg (2011)
Shaw, M.E.: Comparison of individuals and small groups in the rational solution of complex problems. Am. J. Psychol. 44, 491–504 (1932)
Althöfer, I.: Selective trees and majority systems: two experiments with commercial chess computers. In: Advances in Computer Chess 6, pp. 37–59 (1991)
Althöfer, I.: Improved game play by multiple computer hints. Theor. Comput. Sci. 313, 315–324 (2004)
Hanawa M., Ito, T.: The optimal consultation system in a thought algorithm. In: The 3rd Symposium of Entertainment and Cognitive Science, pp. 72–75 (2009) (in Japanese)
Littlestone, N., Warmuth, M.: The weighted majority algorithm. In: Annual Symposium on Foundations of Computer Science (FOCS 1989), pp. 256–261 (1989)
Triplett, N.: The dynamogenic factors in pacemaking and competition. Am. J. Psychol. 9, 507–533 (1898)
Omori S., Hoki K., Ito, T.: Consultation algorithm for computer chess. Technical report 2011-GI-26(5), pp. 1–7 (2011) (in Japanese)
Obata, T., Sugiyama, T., Hoki, K., Ito, T.: Consultation algorithm for computer shogi: move decisions by majority. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 156–165. Springer, Heidelberg (2011)
Sato Y., Cincotti A., Iida H.: An analysis of voting algorithm in games. In: Computer Games Workshop at European Conference on Artificial Intelligence (ECAI) 2012, pp. 102–113 (2012)
Acknowledgments
We would like to thank the anonymous referees for valuable comments that helped to improve this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Spoerer, K.T., Okaneya, T., Ikeda, K., Iida, H. (2014). Further Investigations of 3-Member Simple Majority Voting for Chess. In: van den Herik, H., Iida, H., Plaat, A. (eds) Computers and Games. CG 2013. Lecture Notes in Computer Science(), vol 8427. Springer, Cham. https://doi.org/10.1007/978-3-319-09165-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-09165-5_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09164-8
Online ISBN: 978-3-319-09165-5
eBook Packages: Computer ScienceComputer Science (R0)