Next Article in Journal
Level Sets of Weak-Morse Functions for Triangular Mesh Slicing
Previous Article in Journal
A Geometric Obstruction for CR-Slant Warped Products in a Nearly Cosymplectic Manifold
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Mathematics
Volume 8
Issue 9
10.3390/math8091623
mathematics-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Adversarial Search Method Based on an Iterative Optimal Strategy

by
Chanjuan Liu
1,
Junming Yan
2,
Yuanye Ma
1,
Tianhao Zhao
1,
Qiang Zhang
1,* and
Xiaopeng Wei
1,*
1
School of Computer Science and Technology, Dalian University of Technology; Dalian 116024, China
2
CNGC North Automatic Control Technology Institute, Taiyuan 030000, China
*
Authors to whom correspondence should be addressed.
Mathematics 2020, 8(9), 1623; https://doi.org/10.3390/math8091623
Submission received: 31 August 2020 / Revised: 14 September 2020 / Accepted: 17 September 2020 / Published: 19 September 2020
Browse Figures
Versions Notes

Abstract

A deeper game-tree search can yield a higher decision quality in a heuristic minimax algorithm. However, exceptions can occur as a result of pathological nodes, which are considered to exist in all game trees and can cause a deeper game-tree search, resulting in worse play. To reduce the impact of pathological nodes on the search quality, we propose an iterative optimal minimax (IOM) algorithm by optimizing the backup rule of the classic minimax algorithm. The main idea is that calculating the state values of the intermediate nodes involves not only the static evaluation function involved but also a search into the future, where the latter is given a higher weight. We experimentally demonstrated that the proposed IOM algorithm improved game-playing performance compared to the existing algorithms.
Keywords: minimax; zero-sum games; game tree pathology minimax; zero-sum games; game tree pathology

Share and Cite

MDPI and ACS Style

Liu, C.; Yan, J.; Ma, Y.; Zhao, T.; Zhang, Q.; Wei, X. An Adversarial Search Method Based on an Iterative Optimal Strategy. Mathematics 2020, 8, 1623. https://doi.org/10.3390/math8091623

AMA Style

Liu C, Yan J, Ma Y, Zhao T, Zhang Q, Wei X. An Adversarial Search Method Based on an Iterative Optimal Strategy. Mathematics. 2020; 8(9):1623. https://doi.org/10.3390/math8091623

Chicago/Turabian Style

Liu, Chanjuan, Junming Yan, Yuanye Ma, Tianhao Zhao, Qiang Zhang, and Xiaopeng Wei. 2020. "An Adversarial Search Method Based on an Iterative Optimal Strategy" Mathematics 8, no. 9: 1623. https://doi.org/10.3390/math8091623

APA Style

Liu, C., Yan, J., Ma, Y., Zhao, T., Zhang, Q., & Wei, X. (2020). An Adversarial Search Method Based on an Iterative Optimal Strategy. Mathematics, 8(9), 1623. https://doi.org/10.3390/math8091623

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop