Matrix Game

该数据集记录了一个在大小为2^d的0/1平方矩阵上进行的两人游戏，玩家轮流切割矩阵，并试图通过到达包含1的单元格来获胜。在实例中，随机矩阵被用作输入，同时报告了每个求解器的平均执行时间和失败次数。规模根据矩阵大小2^d而变化，任务是对Qchr方法在解决矩阵游戏中的评估。

This dataset records a two-player game played on a 0/1 binary square matrix of size 2^d. Players take turns cutting the matrix, with the goal of winning by reaching a cell containing a 1. For each game instance, a randomly generated matrix is used as the input, while the average execution time and failure count of each solver are reported. The problem scale varies according to the matrix size 2^d, and the central task of this dataset is to evaluate the Qchr method when solving such matrix games.