Pages that link to "Item:Q3600655"
From MaRDI portal
The following pages link to A symbolic finite-state approach for automated proving of theorems in combinatorial game theory (Q3600655):
Displaying 7 items.
- ToadsAndFrogs (Q24574) (← links)
- Further hopping with toads and frogs (Q540055) (← links)
- Automated verification of state sequence invariants in general game playing (Q1761287) (← links)
- Game of pure chance with restricted boundary (Q2192115) (← links)
- Rook endgame problems in \(m\) by \(n\) chess (Q2406539) (← links)
- Automata in SageMath---Combinatorics meet Theoretical Computer Science (Q2965981) (← links)
- Automated Conjecturing II: Chomp and Reasoned Game Play (Q5114790) (← links)