检索结果-内蒙古大学图书馆

29th Annual IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Paiva Tomaz, Lidia Bononi Silva Julia, Rita Maria Prandini Faria, Matheus Prado Univ Fed Uberlandia Comp Sci Dept Uberlandia MG Brazil

ISBN: (纸本)9781538638767

This paper has two main goals. Its first purpose is to create, in a distributed memory architecture, the Checkers agent APHID-Draughts, which is a player system designed to operate in a high performance environment. This system counts on an unsupervised learning process, where the decisions are made by means of distributed asynchronous version of the alpha-beta algorithm, known as APHID (Asynchronous Parallel Hierarchical Iterative Deepening). The second goal of this paper is to compare the performance in distributed memory architectures between unsupervised player agents operating according to one of the following alpha-beta parallelism approaches: asynchronous or synchronous. This second goal is performed through tournaments in which the agent APHID-Draughts proposed herein faces off with D-VisionDraughts, a Checkers player agent operating with the synchronous distributed version of alpha-beta known as YBWC (Young Brothers Wait Concept). Noteworthy here is that APHID-Draughts and D-VisionDraughts both consist of Multilayer Perceptron Neural Networks that learn through Temporal Difference Methods TD(lambda). Thus, the only difference between these agents refers to the decision-making strategy, since the former uses the asynchronous algorithm APHID and the latter uses the synchronous version YBWC. The results obtained confirm the theoretically expected assumption that asynchronous approaches are more suitable for operating in distributed memory architectures than those of a synchronous nature.

关键词： Asynchronous Parallel Hierarchical Iterative Deepening Young Brothers Wait Concept alpha-beta algorithm Unsupervised Agents for Checkers Machine Learning

来源：评论

学校读者我要写书评

暂无评论

DESIGN, ANALYSIS, AND IMPLEMENTATION OF A PARALLEL TREE-SEARCH algorithm

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1982年第2期4卷 192-203页

作者： AKL, SG BARNARD, DT DORAN, RJ MEMBER IEEE Department of Computing and Information Science Queen"s University Kingston Ont. Canada Department of Computing and Information Science Queen"s University Kingston Ont. Canada Bell-Northern Research Ottawa Ont. Canada

The alpha-beta algorithm for searching decision trees is adapted to allow parallel activity in different parts of a tree during the search. The algorithm has been implemented in a procedural simulation language (GASP IV). The simulation environment provides the illusion of multiple software processes and multiple hardware processors. A number of preliminary experiments have been done to gather statistics on run time, nodes scored, and nodes visited. Results indicate that a substantial reduction in time of search occurs because of the use of parallelism. An analytic expression for the storage requirements of the algorithm is derived. The analysis provides an example of the classical tradeoff between time and storage.

关键词： algorithm design and analysis Parallel processing Decision trees Artificial intelligence Microprocessors Power engineering computing Information science Hardware Statistics Computer aided instruction Author Keywords simulation alpha-beta algorithm artificial intelligence decision tree game playing program multiple instruction stream multiple data stream (MIMD) computer parallelism search techniques

来源：评论

学校读者我要写书评

暂无评论

Building an Arimaa-playing program using Basic Search algorithms 2

Building an Arimaa-playing program using Basic Search Algori...

引用

2nd International Conference on Information Systems and Computer Science (INCISCOS)

作者： Rubio, Jose-Miguel Salas, Juan Univ Tecnol Chile INACAP Dept Comp Sci Santiago Chile Univ Tecnol Chile INACAP IT Acad Santiago Chile

ISBN: (纸本)9781538626443

This paper details the development of an Arimaa program prototype, a board game with very simple and intuitive rules to humans, but which are very complex for computers. In order to approach this problem, the game was analyzed, studying its official history, how it is played, its rules, and the complications presented when programming it. An approach to achieve this goal was then designed, incorporating solutions that have been developed for chess, defining a numerical representation of the data, and introducing a movement generator, a search function, a Minimax algorithm with alpha-beta pruning, and function evaluation, before finally proceeding with the implementation and evaluation of a prototype.

关键词： arimaa challenge minimax algorithm alpha-beta algorithm artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Research on Search algorithm in Surakarta Chess Game System

International Core Journal of Engineering

引用

International Core Journal of Engineering 2023年第7期9卷 286-293页

作者： Tao Zhang Yefeng Jiang Bowen Li

This paper introduces Surakarta, an important branch in the field of computer games, and discusses two search algorithms used in this game: alpha-beta pruning algorithm and UCT algorithm. The search algorithm plays a central role in the game system and affects the performance and efficiency of the system. alpha-beta pruning algorithm is an optimized and improved maxima-minimum algorithm, which reduces unnecessary search branches and improves search efficiency through pruning principles. The UCT algorithm is a game tree search algorithm based on the Monte Carlo method, which estimates the true value of the action through random simulation and tree building and expansion, and adjusts the strategy to the best priority strategy. The application of these two algorithms in the Surakarta chess game system can improve the performance and accuracy of computer games. Through the research and application of Surakarta chess, it can not only promote the development of artificial intelligence in chess games, but also provide enlightenment for problem solving in other fields.

关键词： Surakarta Chess alpha-beta algorithm UCT algorithm Monte Carlo algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on integrated computer game algorithm for dots and boxes

引用

JOURNAL OF ENGINEERING-JOE 2020年第13期2020卷 601-606页

作者： Li, Shuqin Zhang, Yipeng Ding, Meng Dai, Pengcheng Beijing Informat Sci & Technol Univ Comp Acad Beijing Peoples R China Percept & Computat Intelligence Joint Lab 35 North Fourth Ring Rd Beijing Peoples R China

Situation assessment and search are two key problems in computer game research. In general, as the game progresses, the difficulty of evaluating the situation of the game is significantly reduced, and the accuracy of the evaluation is significantly increased. Based on the famous chess game, this article proposes and implements a new scheme that combines the Monte Carlo tree search algorithm, the alpha-beta algorithm and the model based on the deep convolution neural network (CNN) to solve the computer game problem. This article first proposes a deep convolutional neural network model based on dots and boxes, including deep value network and deep strategy network, focusing on situation assessment and strategy recommendation, respectively. Then, using the Monte Carlo Tree Search (MCTS) algorithm as a framework, deep value network integrated MCTS algorithm and deep strategy network integrated MCTS algorithm are proposed. In both integrated models, alpha-beta complete search is used to truncate the Monte Carlo simulation process and improve simulation efficiency. Through competition with human players, the results show that the two integrated algorithm game systems have reached much higher intelligence level than ordinary humans in solving the problem of dots and boxes.

关键词： C++ language tree searching Monte Carlo methods artificial intelligence neural nets computer games game theory research on integrated computer game algorithm dots computer game research game progresses famous chess game Monte Carlo tree search algorithm alpha-beta algorithm deep convolution neural network computer game problem deep convolutional neural network model deep value network situation assessment strategy recommendation Monte Carlo Tree Search algorithm deep strategy network integrated MCTS algorithm integrated models alpha-beta complete search Monte Carlo simulation process integrated algorithm game systems

来源：评论

学校读者我要写书评

暂无评论

The Application of Optimized Artificial Intelligence algorithm in Chinese Chess

The Application of Optimized Artificial Intelligence Algorit...

引用

2017 5th International Conference on Frontiers of Manufacturing Science and Measuring Technology(FMSMT 2017)

作者： Yingying Qiu Guangxi Economic and Trade Vocational and Technical College

ISBN: (纸本)9781510840232

In the field of artificial intelligence, the rule of Chinese chess is different from International chess and chess and it decided that the Chinese chess artificial intelligence algorithm has its particularity. Based on the characteristics of Chinese chess, this paper analyzes the computer artificial intelligence algorithm of Chinese chess, such as game tree algorithm, historical heuristic algorithm and alpha-beta algorithm, and puts forward the recent activity method, dynamic sub-force method and player style method. The computational analysis shows that the improved new algorithm has a significant improvement in efficiency and speed.

关键词： Chinese Chess Artificial Intelligence algorithm Game Tree algorithm Historical Heuristic algorithm alpha-beta algorithm Recent Activity Method Dynamic Sub-Force Method Player Style Method

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：