AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Improving Search with Supervised Learning in Trick-Based Card Games

Christopher Solinas, Douglas Rebstock, Michael Buro

AAAI 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Search for program synthesis · 20 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use human-trained cardplay-history inference in addition to bidding and declaration inferencePIMC Skat player · Suit gamesaverage tournament score per game: 4.9; 5.0; 5.4Improved
Use human-trained cardplay-history inference in addition to bidding and declaration inferencePIMC Skat player · Grand gamesaverage tournament score per game: 2.6; 2.9; 3.1Improved
Use human-trained cardplay-history inference in addition to bidding and declaration inferencePIMC Skat player · Null gamesaverage tournament score per game: 6.3; 6.3; 5.0Improved
Use neural card-location inference from bidding, declaration, and cardplay history instead of uniform samplingPIMC Skat player · Suit gamesaverage tournament score per game: 9.4; 7.6; 8.3Improved
Use neural card-location inference from bidding, declaration, and cardplay history instead of uniform samplingPIMC Skat player · Null gamesaverage tournament score per game: 8.9; 9.9; 10.8Improved
Use neural card-location inference from bidding, declaration, and cardplay history instead of uniform samplingPIMC Skat player · Grand gamesaverage tournament score per game: 3.7; 3.7; 4.0Improved
Use cardplay-history inference instead of BDI's bidding-and-declaration-only inferencePIMC Skat player · Suit gamessoloist win percentageImproved
Use cardplay-history inference instead of BDI's bidding-and-declaration-only inferencePIMC Skat player · Null gamessoloist win percentageImproved
Use cardplay-history inference instead of BDI's bidding-and-declaration-only inferencePIMC Skat player · Grand gamesaverage tournament score per game against KI: 0.9; 1.3; 2.1No clear effect
Use Kermit's count-based inference instead of BDI individual-card predictions without cardplay historyPIMC Skat player · Suit gamesaverage tournament score per game: 2.1; 0.5; 0.4Improved
Use Kermit's count-based inference instead of BDI individual-card predictions without cardplay historyPIMC Skat player · Grand gamesaverage tournament score per game: 0.3; 1.4; 0.5Mixed
Use Kermit's count-based inference instead of BDI individual-card predictions without cardplay historyPIMC Skat player · Null gamesaverage tournament score per game: 1.1; 1.3; 1.3Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy