Abstract
Recently several researchers have shown an interest in the complexity of determining the existence of winning strategies in various games. The purpose of this note is to show that this problem is (probably) much more difficult for games in which the players lack perfect information about the state of the game. Familiar examples of games of this type include Kriegspiel (blindfold chess) and Battleship. In particular, we show that a simple one token game on graphs requires polynomial space to analyze in its blindfold version, although polynomial time is known to be sufficient for the version with perfect information.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
