Computational Modelling for Combinatorial Game Strategies
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912757031370752 |
|---|---|
| author | Diaconescu, Răzvan |
| author_facet | Diaconescu, Răzvan |
| contents | We develop a generic computational model that can be used effectively for establishing the existence of winning strategies for concrete finite combinatorial games. Our modelling is (equational) logic-based involving advanced techniques from algebraic specification, and it can be executed by equational programming systems such as those from the OBJ-family. We show how this provides a form of experimental mathematics for strategy problems involving combinatorial games. We do this by defining general methods and by illustrating these with case studies. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_03955 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Computational Modelling for Combinatorial Game Strategies Diaconescu, Răzvan Logic in Computer Science Computer Science and Game Theory We develop a generic computational model that can be used effectively for establishing the existence of winning strategies for concrete finite combinatorial games. Our modelling is (equational) logic-based involving advanced techniques from algebraic specification, and it can be executed by equational programming systems such as those from the OBJ-family. We show how this provides a form of experimental mathematics for strategy problems involving combinatorial games. We do this by defining general methods and by illustrating these with case studies. |
| title | Computational Modelling for Combinatorial Game Strategies |
| topic | Logic in Computer Science Computer Science and Game Theory |
| url | https://arxiv.org/abs/2408.03955 |