Cargando…
Strongly solved Ostle: calculating a strong solution helps compose high-quality puzzles for recent games
Pure strategy board games such as chess are popular intellectual activities, and solving them is a challenging task in computer science. In addition to traditional games, many new board games have gained popularity in recent years. Ostle is one such unsolved game published in 2017. It is based on si...
Autor principal: | Takizawa, Hiroki |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10557503/ https://www.ncbi.nlm.nih.gov/pubmed/37810330 http://dx.doi.org/10.7717/peerj-cs.1560 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
A novel approach for solving travelling thief problem using enhanced simulated annealing
por: Ali, Hamid, et al.
Publicado: (2021) -
A new imperialist competitive algorithm with spiral rising mechanism for solving path optimization problems
por: Li, Xia, et al.
Publicado: (2022) -
An algorithm for calculating top-dimensional bounding chains
por: Carvalho, J. Frederico, et al.
Publicado: (2018) -
A hyper-matheuristic approach for solving mixed integer linear optimization models in the context of data envelopment analysis
por: Gonzalez, Martin, et al.
Publicado: (2022)