five

The (i,j)-4 × 4-outflanking-stab game (OS game)

收藏
Mendeley Data2024-01-31 更新2024-06-29 收录
下载链接:
http://doi.nrct.go.th/?page=resolve_doi&resolve_doi=10.14457/TU.the.2020.686
下载链接
链接失效反馈
官方服务:
资源简介:
Let i, j, m, and n be positive integers such that m, n ≥ 2. An (i, j)- m×n-Outflanking-Stab game is played on an m×n board by two players: White and Black. Each player has n tokens, which can be moved like the rook in chess. White’s tokens are arranged in the 1st row, and Black’s tokens are arranged in the mth row. In each turn, White moves i times, and Black moves j times. There are two ways to capture oppenent’s tokens, which are outflanking and stab. A player loses if he cannot move any token, or his tokens are all captured. The game ends in a draw if there is no capture in the last max{i,12+3j} moves. In this thesis, we provide some strategies for the (i,j)-4×4-OS game.
创建时间:
2024-01-31
5,000+
优质数据集
54 个
任务类型
进入经典数据集
二维码
社区交流群

面向社区/商业的数据集话题

二维码
科研交流群

面向高校/科研机构的开源数据集话题

数据驱动未来

携手共赢发展

商业合作