Gaming the Identified and Unidentified through Puzzle Resolving With an Artificial Intelligence Agent

Gaming the Identified and Unidentified through Puzzle Resolving With an Artificial Intelligence Agent

Artificial Intelligence Data AI Problem Solving

Scientists design and style multiple methods for an artificial clever (AI) agent to address a stochastic puzzle like Minesweeper.

For a long time, attempts in solving video games experienced been distinctive to resolving two-player online games (i.e., board games like checkers, chess-like games, etc.), in which the match consequence can be accurately and competently predicted by making use of some synthetic intelligence (AI) look for technique and amassing a enormous quantity of gameplay studies. Having said that, such a method and procedure can not be applied immediately to the puzzle-fixing domain given that puzzles are commonly played by yourself (solitary-player) and have special qualities (these as stochastic or hidden data). So then, a concern arose as to how the AI method can keep its general performance for resolving two-player online games but alternatively used to a solitary-agent puzzle?

For many years, puzzles and online games experienced been regarded as interchangeable or 1 part of the other. In real truth, this may perhaps not be the situation all the time. Wanting from a serious-earth viewpoint, ‘game’ is a thing we encounter each and every day dealing with the unidentified. For occasion, the not known of producing the ideal decision (i.e., receiving married) or the wrong 1 (i.e., quitting a occupation) or not creating just one at all (i.e., regrets on ‘what if’). Meanwhile, ‘puzzle’ is one thing that was identified to be there, and even a thing is concealed still to be uncovered. This kind of a recognised case, for instance, would be the discovery of ‘wonder’ materials like AI Boundary of Solvability

The figure depicts AI strategies that use knowledge-driven strategies to deal with unknown information while adopting data-driven strategies to use the known information of the Minesweeper puzzle. The resultant findings establish the boundary condition for solvability in a single-player stochastic puzzle which is canonical to broad real-world problems. Credit: Hiroyuki Iida from JAIST

The researchers adopted an AI agent composed of two knowledge-driven strategies and two data-driven strategies to best use the known and unknown information of the current decision to best estimate the subsequent decision to make. As a result, the boundary between the puzzle-solving and game-playing paradigm can be established for the single-agent stochastic puzzle like the Minesweeper.

Such a condition plays a particularly important role in real-world problems where the boundary between the known and unknown is usually blurred and very hard to identify. As Professor Iida remarks: “With the capability of AI agent to enhance puzzle solving performance, the boundary of solvability become apparent. Such a situation allowed the clear definition of ‘puzzle’ and ‘game’ conditions, typically found in many real-life situations, such as determining high-stake investment, assessing the risk level of an important decision, and so on.” In essence, we all live in our Minesweeper world, trying to guess our way forward while avoiding the ‘bomb’ in our life.

Many uncertainties existed with the face-paced advancement of existing technology and new paradigm of computing available (i.e., IoT, cloud-based services, edge computing, neuromorphic computing, etc.). This condition could be true for people (i.e., technological affordance), community (i.e., technology acceptance), society (i.e., culture and norm), and even at the national levels (i.e., policy and rules changes). “Every day human activity involves a lot of ‘game’ and ‘puzzle’ conditions. However, mapping the solvability paradigm at scale, boundary conditions between the known and the unknown can be established, minimizing the risk of the unknown and maximizing the benefit of the known,” explains Ms. Chang Liu, the lead author of the study. “Such a feat is achieved by culminating knowledge-driven techniques, AI technology, and measurable uncertainty (such as winning rate, success rate, progress rate, etc.) while still keeping the puzzle fun and challenging.”

Reference: “A solver of single-agent stochastic puzzle: A case study with Minesweeper” by Chang Liu, Shunqi Huang, Gao Naying, Mohd Nor Akmal Khalid and Hiroyuki Iida, 28 March 2022, Knowledge-Based Systems.
DOI: 10.1016/j.knosys.2022.108630

About Japan Advanced Institute of Science and Technology, Japan

Founded in 1990 in Ishikawa prefecture, the Japan Advanced Institute of Science and Technology (JAIST) was the first independent national graduate school in Japan. Now, after 30 years of steady progress, JAIST has become one of Japan’s top-ranking universities. JAIST counts with multiple satellite campuses and strives to foster capable leaders with a state-of-the-art education system where diversity is key; about 40% of its alumni are international students. The university has a unique style of graduate education based on a carefully designed coursework-oriented curriculum to ensure that its students have a solid foundation on which to carry out cutting-edge research. JAIST also works closely both with local and overseas communities by promoting industry–academia collaborative research.

About Ms. Chang Liu from Japan Advanced Institute of Science and Technology, Japan

Ms. Chang Liu is a doctoral student at the School of Advanced Science and Technology (JAIST), Nomi, Japan. Her research focuses on researching appeal information about the evolution of puzzle games based on the game mechanics and player’s experience, supervised by Professor Hiroyuki Iida in the Lab of Entertainment Technology. She is working on analyzing the significant factors in the evolution of ancient to modern puzzle games, and the information analysis during the process of solving puzzles and playing games, to finding a line between puzzles and games.

About Professor Hiroyuki Iida from Japan Advanced Institute of Science and Technology, Japan

Dr. Hiroyuki Iida received his Ph.D. in 1994 on Heuristic Theories on Game-Tree Search from the Tokyo University of Agriculture and Technology, Japan. Since 2005, he has been a Professor at JAIST, where he is also a Trustee and Vice President of Educational and Student Affairs. He is the head of the Iida laboratory and has published over 300 papers, presentations, and books. His research interests include artificial intelligence, game informatics, game theory, mathematical modeling, search algorithms, game-refinement theory, game tree search, and entertainment science.

Funding information

This study was funded by a grant from the Japan Society for the Promotion of Science in the framework of the Grant-in-Aid for Challenging Exploratory Research (Grant Number 19K22893).