markstanl commited on
Commit
0f20750
·
verified ·
1 Parent(s): 866314a

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +23 -6
README.md CHANGED
@@ -60,19 +60,31 @@ size_categories:
60
  # Dataset Card for U3T
61
 
62
  This dataset stores refactored data of [Monte Carlo Search Tree Evaluations](https://en.wikipedia.org/wiki/Monte_Carlo_tree_search) edited from arnowaczynski's [utttai](https://github.com/arnowaczynski/utttai), for the game [Ultimate-tic-tac-toe](https://en.wikipedia.org/wiki/Ultimate_tic-tac-toe) (U3T).
63
- One can use this data to train a model to evaluate positions or predict moves.
 
 
 
 
 
 
 
 
 
 
64
 
65
  ## Dataset Details
66
 
67
- This dataset contains over 8 million evaluated positions at varying depth (via [utttai](https://github.com/arnowaczynski/utttai/tree/main/datasets)):
68
  ![Depth Graph from UTTTAI](assets/depth_graph.png)
69
 
70
- Each evaluated positions counts the number of wins, draws, and loses, giving an estimation as to how good a position is. Each position stores an array of legal moves, and their respective
71
  MCTS searches.
72
 
73
  ## Uses
74
 
75
- One can use this dataset in an way they want. But, it is mainly intended for making a deep learning model to play U3T, or evaluate a static position.
 
 
76
 
77
  ## Dataset Structure
78
 
@@ -135,11 +147,16 @@ The dataset was split into a train, test, and validation set, with a distributio
135
 
136
  ### Curation Rationale
137
 
138
- The original dataset by arnowaczynski was not stored in a conventional big data format, and used some unconventional index storing [(detailed here)](https://github.com/markstanl/uttt-bots/blob/main/utttai_conversion/utttai.md).
139
- So, we decided to refactor it and upload it here, to Hugging Face, in a dataset that is more efficient for NN training.
140
 
141
 
142
  ### Source Data
143
 
144
  arnowaczynski generated these datasets in their [GitHub Repository](https://github.com/arnowaczynski/utttai/tree/main/datasets). Further documentation on how
145
  the dataset was generated is available at that link.
 
 
 
 
 
 
60
  # Dataset Card for U3T
61
 
62
  This dataset stores refactored data of [Monte Carlo Search Tree Evaluations](https://en.wikipedia.org/wiki/Monte_Carlo_tree_search) edited from arnowaczynski's [utttai](https://github.com/arnowaczynski/utttai), for the game [Ultimate-tic-tac-toe](https://en.wikipedia.org/wiki/Ultimate_tic-tac-toe) (U3T).
63
+ MCTS evaluations provide probabilistic estimates of how advantageous a given game position or move is for a player.
64
+
65
+
66
+ ### About Ultimate Tic-Tac-Toe
67
+ From Wikipedia:
68
+ ```
69
+ Ultimate tic-tac-toe is a board game composed of nine tic-tac-toe boards arranged in a 3 × 3 grid. Players take turns playing on the smaller tic-tac-toe boards until one of them wins on the larger board. Compared to traditional tic-tac-toe, strategy in this game is conceptually more difficult and has proven more challenging for computers.
70
+ ```
71
+
72
+ Ultimate Tic-Tac-Toe remains a largely unexplored domain in AI research. While there have been some academic papers and small-scale attempts to develop AI for this game (with some being quite successful), not much effort has been put in to making advanced bots. This dataset provides a structured and scalable resource for researchers and developers looking to build AI models for U3T.
73
+ By leveraging MCTS evaluations, this dataset offers a foundation for training AI to better understand strategic play in a complex yet structured environment. Given the lack of extensive research in this field, this dataset represents a unique opportunity to contribute to an emerging area of AI-driven gameplay.
74
 
75
  ## Dataset Details
76
 
77
+ This dataset contains **over 8 million** evaluated positions at varying depths of play (via [utttai](https://github.com/arnowaczynski/utttai/tree/main/datasets)):
78
  ![Depth Graph from UTTTAI](assets/depth_graph.png)
79
 
80
+ Each evaluated positions counts the number of wins, draws, and loses, giving a probabilisitc estimation as to how good a position is. Each position stores an array of legal moves, and their respective
81
  MCTS searches.
82
 
83
  ## Uses
84
 
85
+ The MCTS evaluation can be used for many types of game evaluations. The MCTS of every position can be used for making a static evaluator, or the evaluations of every
86
+ legal move from a position can be used to train a model to predict the best moves. There are many ways to use this set, but the dataset is specifically tuned for making making deep learning models that can play U3T, or evaluate a static position.
87
+ It is further recommended that any bot you make with this as initial training should be fine-tuned with reinforcement learning.
88
 
89
  ## Dataset Structure
90
 
 
147
 
148
  ### Curation Rationale
149
 
150
+ The original dataset by arnowaczynski was not structured for large-scale machine learning and used an unconventional indexing method [(detailed here)](https://github.com/markstanl/uttt-bots/blob/main/utttai_conversion/utttai.md).
151
+ To optimize for neural network training, we refactored it and uploaded the improved version to Hugging Face.
152
 
153
 
154
  ### Source Data
155
 
156
  arnowaczynski generated these datasets in their [GitHub Repository](https://github.com/arnowaczynski/utttai/tree/main/datasets). Further documentation on how
157
  the dataset was generated is available at that link.
158
+
159
+ ### Contribution
160
+
161
+ Contributing is highly encouraged and appreciated. This does not need to be expanding upon this dataset. It can be building different models or datasets.
162
+ Opening PRs here or reaching out to me individually is encouraged.