Algorithm design with the selection monad
The selection monad has proven useful for modelling exhaustive search algorithms. It is well studied in the area of game theory as an elegant way of expressing algorithms that calculate optimal plays for sequential games with perfect information; composition of moves is modeled as a ‘product’ of sel...
| 主要な著者: | , |
|---|---|
| フォーマット: | Conference item |
| 言語: | English |
| 出版事項: |
Springer
2023
|