Multitype Game Optimisation: A Two-Stage Fine-Tuning Framework for Multi‑Game Optimisation With Large Language Models

IF 5.1 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
CAAI Transactions on Intelligence Technology Pub Date : 2026-06-30 Epub Date: 2026-02-27 DOI:10.1049/cit2.70108
Xiali Li, Jingshi Gu, Feifan He, Yang Xiao, Yuanli Jia, Ping Lan
{"title":"Multitype Game Optimisation: A Two-Stage Fine-Tuning Framework for Multi‑Game Optimisation With Large Language Models","authors":"Xiali Li,&nbsp;Jingshi Gu,&nbsp;Feifan He,&nbsp;Yang Xiao,&nbsp;Yuanli Jia,&nbsp;Ping Lan","doi":"10.1049/cit2.70108","DOIUrl":null,"url":null,"abstract":"<p>Large language models (LLMs) have made remarkable advances in natural language processing, demonstrating great potential in modelling structured sequences. However, adapting these capabilities to machine gaming tasks such as Go remains challenging due to limitations in strategy generalisation and optimisation efficiency. This paper presents multitype game optimisation (MyGO), a two-stage fine-tuning framework tailored for two-player perfect information board games, exploring the applicability of LLMs to nonlinguistic decision-making domains. In the supervised fine-tuning stage, we propose a unified structural encoding method, action semantic unit (ASU), which efficiently converts heterogeneous game records into discrete token sequences compatible with LLMs. In the reinforcement learning stage, we design TA-PPO (token-level adaptive proximal policy optimisation), an enhanced PPO-based algorithm to address the issue of sparse feedback commonly encountered in game reinforcement learning. Experimental results demonstrate that the fine-tuned models achieve superior or comparable performance to traditional game-playing algorithms in terms of strategy quality, rule generalisation and inference efficiency. This work provides a scalable paradigm for fine-tuning LLMs in complex decision-making tasks and lays a foundation for future research in game AI and generalisable strategy optimisation.</p>","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":"11 3","pages":"739-753"},"PeriodicalIF":5.1000,"publicationDate":"2026-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cit2.70108","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CAAI Transactions on Intelligence Technology","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/cit2.70108","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/27 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Large language models (LLMs) have made remarkable advances in natural language processing, demonstrating great potential in modelling structured sequences. However, adapting these capabilities to machine gaming tasks such as Go remains challenging due to limitations in strategy generalisation and optimisation efficiency. This paper presents multitype game optimisation (MyGO), a two-stage fine-tuning framework tailored for two-player perfect information board games, exploring the applicability of LLMs to nonlinguistic decision-making domains. In the supervised fine-tuning stage, we propose a unified structural encoding method, action semantic unit (ASU), which efficiently converts heterogeneous game records into discrete token sequences compatible with LLMs. In the reinforcement learning stage, we design TA-PPO (token-level adaptive proximal policy optimisation), an enhanced PPO-based algorithm to address the issue of sparse feedback commonly encountered in game reinforcement learning. Experimental results demonstrate that the fine-tuned models achieve superior or comparable performance to traditional game-playing algorithms in terms of strategy quality, rule generalisation and inference efficiency. This work provides a scalable paradigm for fine-tuning LLMs in complex decision-making tasks and lays a foundation for future research in game AI and generalisable strategy optimisation.

Abstract Image

多类型的游戏优化:一个两阶段的微调框架,多游戏优化与大型语言模型
大型语言模型(llm)在自然语言处理方面取得了显著进展,在结构化序列建模方面显示出巨大的潜力。然而,由于策略泛化和优化效率的限制,将这些功能应用于机器游戏任务(如围棋)仍然具有挑战性。本文提出了多类型游戏优化(MyGO),这是一个为两名玩家完美信息棋盘游戏量身定制的两阶段微调框架,探索llm在非语言决策领域的适用性。在监督微调阶段,我们提出了一种统一的结构编码方法——动作语义单元(ASU),该方法有效地将异构博弈记录转换为与llm兼容的离散令牌序列。在强化学习阶段,我们设计了TA-PPO(令牌级自适应近端策略优化),这是一种增强的基于ppo的算法,用于解决博弈强化学习中常见的稀疏反馈问题。实验结果表明,微调后的模型在策略质量、规则泛化和推理效率方面都优于或比得上传统的博弈算法。这项工作为在复杂决策任务中微调llm提供了一个可扩展的范例,并为未来游戏AI和通用策略优化的研究奠定了基础。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CAAI Transactions on Intelligence Technology
CAAI Transactions on Intelligence Technology COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
11.00
自引率
3.90%
发文量
134
审稿时长
35 weeks
期刊介绍: CAAI Transactions on Intelligence Technology is a leading venue for original research on the theoretical and experimental aspects of artificial intelligence technology. We are a fully open access journal co-published by the Institution of Engineering and Technology (IET) and the Chinese Association for Artificial Intelligence (CAAI) providing research which is openly accessible to read and share worldwide.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书