Pages that link to "Item:Q5963617"
From MaRDI portal
The following pages link to On the computational complexity of bridgecard (Q5963617):
Displaying 7 items.
- UNO is hard, even for a single player (Q389942) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- Complexity of scorpion solitaire and applications to klondike (Q2235738) (← links)
- Learning to bid in bridge (Q2433171) (← links)
- A study of a generalization of a card problem (Q2485637) (← links)
- Diagrammatic Representation and Inference (Q5714064) (← links)
- Dynamic Play via Suit Factorization Search in Skat (Q6488126) (← links)