Re-evaluating metamorphic testing of chess engines: A replication study

IF 4.3 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Information and Software Technology Pub Date : 2025-05-01 Epub Date: 2025-02-06 DOI:10.1016/j.infsof.2025.107679
Axel Martin , Djamel Eddine Khelladi , Théo Matricon , Mathieu Acher
{"title":"Re-evaluating metamorphic testing of chess engines: A replication study","authors":"Axel Martin ,&nbsp;Djamel Eddine Khelladi ,&nbsp;Théo Matricon ,&nbsp;Mathieu Acher","doi":"10.1016/j.infsof.2025.107679","DOIUrl":null,"url":null,"abstract":"<div><h3>Context:</h3><div>This study aims to confirm, replicate and extend the findings of a previous article entitled <em>”Metamorphic Testing of Chess Engines”</em> that reported inconsistencies in the analyses provided by <em>Stockfish</em>, the most widely used chess engine, for transformed chess positions that are fundamentally identical. Initial findings, under conditions strictly identical to those of the original study, corroborate the reported inconsistencies.</div></div><div><h3>Objective:</h3><div>However, the original article considers a specific dataset (including randomly generated chess positions, end-games, or checkmate problems) and very low analysis depth (10 plies,<span><span><sup>1</sup></span></span> corresponding to 5 moves). These decisions pose threats that limit generalizability of the results, but also their practical usefulness both for chess players and maintainers of Stockfish. Thus, we replicate the original study.</div></div><div><h3>Methods:</h3><div>We consider this time (1) positions derived from actual chess games, (2) analyses at appropriate and larger depths, and (3) different versions of Stockfish. We conduct novel experiments on thousands of positions, employing significantly deeper searches.</div></div><div><h3>Results:</h3><div>The replication results show that the Stockfish chess engines demonstrate significantly greater consistency in its evaluations. The metamorphic relations are not as effective as in the original article, especially on realistic chess positions. We also demonstrate that, for any given position, there exists a depth threshold beyond which further increases in depth do not result in any evaluation differences for the studied metamorphic relations. We perform an in-depth analysis to identify and clarify the implementation reasons behind Stockfish’s inconsistencies when dealing with transformed positions.</div></div><div><h3>Conclusion:</h3><div>A first concrete result is thus that metamorphic testing of chess engines is not yet an effective technique for finding faults of Stockfish. Another result is the lessons learned through this replication effort: metamorphic relations must be verified in the context of the domain’s specificities; without such contextual validation, they may lead to misleading or irrelevant conclusions; changes in parameters and input dataset can drastically alter the effectiveness of a testing method.</div></div>","PeriodicalId":54983,"journal":{"name":"Information and Software Technology","volume":"181 ","pages":"Article 107679"},"PeriodicalIF":4.3000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Software Technology","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950584925000187","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/6 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Context:

This study aims to confirm, replicate and extend the findings of a previous article entitled ”Metamorphic Testing of Chess Engines” that reported inconsistencies in the analyses provided by Stockfish, the most widely used chess engine, for transformed chess positions that are fundamentally identical. Initial findings, under conditions strictly identical to those of the original study, corroborate the reported inconsistencies.

Objective:

However, the original article considers a specific dataset (including randomly generated chess positions, end-games, or checkmate problems) and very low analysis depth (10 plies,1 corresponding to 5 moves). These decisions pose threats that limit generalizability of the results, but also their practical usefulness both for chess players and maintainers of Stockfish. Thus, we replicate the original study.

Methods:

We consider this time (1) positions derived from actual chess games, (2) analyses at appropriate and larger depths, and (3) different versions of Stockfish. We conduct novel experiments on thousands of positions, employing significantly deeper searches.

Results:

The replication results show that the Stockfish chess engines demonstrate significantly greater consistency in its evaluations. The metamorphic relations are not as effective as in the original article, especially on realistic chess positions. We also demonstrate that, for any given position, there exists a depth threshold beyond which further increases in depth do not result in any evaluation differences for the studied metamorphic relations. We perform an in-depth analysis to identify and clarify the implementation reasons behind Stockfish’s inconsistencies when dealing with transformed positions.

Conclusion:

A first concrete result is thus that metamorphic testing of chess engines is not yet an effective technique for finding faults of Stockfish. Another result is the lessons learned through this replication effort: metamorphic relations must be verified in the context of the domain’s specificities; without such contextual validation, they may lead to misleading or irrelevant conclusions; changes in parameters and input dataset can drastically alter the effectiveness of a testing method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
重新评估象棋引擎的变形测试:一项复制研究
背景:本研究旨在确认、复制和扩展之前一篇名为“国际象棋引擎的变形测试”的文章的发现,该文章报告了Stockfish(最广泛使用的国际象棋引擎)提供的分析中不一致的地方,这些分析基本上是相同的。在与原始研究严格相同的条件下,初步发现证实了报告的不一致。目的:然而,原始文章考虑了一个特定的数据集(包括随机生成的国际象棋位置,结束游戏或将死问题)和非常低的分析深度(10层,1对应5步)。这些决定限制了结果的通用性,但也限制了它们对棋手和Stockfish维护者的实际用处。因此,我们重复了最初的研究。方法:这次我们考虑(1)从实际棋局中得出的位置,(2)在适当和更大的深度进行分析,(3)不同版本的Stockfish。我们对数千个职位进行了新颖的实验,采用了更深入的搜索。结果:复制结果表明,Stockfish象棋引擎在其评价中表现出更大的一致性。变形关系不像原文那样有效,特别是在现实的棋位上。我们还证明,对于任何给定的位置,存在一个深度阈值,超过该阈值,进一步增加深度不会导致所研究的变质关系的评价差异。我们进行了深入的分析,以确定和澄清Stockfish在处理转换位置时不一致的实施原因。结论:第一个具体的结果是,象棋引擎的变质测试还不是一种发现Stockfish缺陷的有效技术。另一个结果是通过复制工作获得的经验教训:必须在领域特殊性的上下文中验证变形关系;如果没有上下文验证,它们可能会导致误导性或不相关的结论;参数和输入数据集的变化会极大地改变测试方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information and Software Technology
Information and Software Technology 工程技术-计算机:软件工程
CiteScore
9.10
自引率
7.70%
发文量
164
审稿时长
9.6 weeks
期刊介绍: Information and Software Technology is the international archival journal focusing on research and experience that contributes to the improvement of software development practices. The journal''s scope includes methods and techniques to better engineer software and manage its development. Articles submitted for review should have a clear component of software engineering or address ways to improve the engineering and management of software development. Areas covered by the journal include: • Software management, quality and metrics, • Software processes, • Software architecture, modelling, specification, design and programming • Functional and non-functional software requirements • Software testing and verification & validation • Empirical studies of all aspects of engineering and managing software development Short Communications is a new section dedicated to short papers addressing new ideas, controversial opinions, "Negative" results and much more. Read the Guide for authors for more information. The journal encourages and welcomes submissions of systematic literature studies (reviews and maps) within the scope of the journal. Information and Software Technology is the premiere outlet for systematic literature studies in software engineering.
期刊最新文献
Designing with Dev-X: A systematic mapping of Developer Experience interventions and their business impact Domain-aware graph neural networks for source code vulnerability detection A hybrid XGBoost and SHAP framework for prioritization and interaction analysis of factors driving metaverse adoption in an engineering context Robust and efficient log anomaly detection: A hybrid ID-semantic approach for evolving systems Mutation testing based on non-cooperative Stackelberg game
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1