Indian Journal of Science and Technology
Year: 2019, Volume: 11, Issue: 10, Pages: 1-14
Francisco Javier Moreno Arboleda, Daniel Esteban Guevara Vergara and Luis Humberto Bermúdez Torres
Computing and Decision Systems Department, Universidad Nacional de Colombia, Sede Medellín, Bloque M8A; [email protected], [email protected], [email protected]
*Author for correspondence
Francisco Javier Moreno Arboleda,
Computing and Decision Systems Department, Universidad Nacional de Colombia, Sede Medellín, Bloque M8A; [email protected]
Objectives: In this paper, we proposed a Kriegspiel (invisible chess) variant where we consider probabilistic information about the positions of the opponent’s pieces. Methods/Statistical Analysis: For dealing with probabilistic Krieg spiel, we took as a basis the proposal of Ciancarini, DallaLibera & Maran. They consider four Krieg spiel patterns which we modified to fulfill the probabilistic requirements of the tackled endgames. A strategy was also proposed for when none of these patterns is fulfilled. We developed an automaton which implements the proposed probabilistic patterns. Findings: Our results showed the feasibility of our proposal, where White won or drew as expected. To the best of our knowledge, this is the first proposal that considers probabilistic Krieg spiel. Our automaton shows that when working with probabilities in Krieg spiel, it is not always convenient to play considering the higher probability. Our proposal develops a strategy that can help competitors to make better decisions when they have incomplete information about a specific situation, e.g., to choose between two alternatives, each with its respective probability. Application/Improvements: We believe that our proposal may be useful in areas where uncertainty occurs. It can help analysts, particularly in the economics and artificial intelligence, to make decisions when uncertainty occurs.
Keywords: Chess Krieg Spiel, Probability, Strategy, Uncertainty
Subscribe now for latest articles and news.