Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
In this work, we develop a player for the game of hearts, a 4-player game, based on stochastic linear regression and TD learning. Using a small set of basic.
In this work, we develop a player for the game of hearts, a 4-player game, based on stochastic linear regression and TD learning. Using a small set of basic ...
In this work, we develop a player for the game of hearts, a 4-player game, based on stochastic linear regression and TD learning. Using a small set of basic ...
We report initial results on learning with various combinations of features and training under self-play and against search-based players. Our simple learner ...
Feature Construction for Reinforcement Learning in Hearts. 125 value function according to the observed rewards. TD uses bootstrapping, where an agent ...
People also ask
Baxter, J., Trigdell, A., Weaver, L.: Knightcap: a Chess Program that Learns by Combining TD(λ) with Game-Tree Search. In: Proc. 15th International Conf. on ...
Feature Construction for Reinforcement Learning in Hearts by Nathan R. Sturtevant, Adam M. White published in Lecture Notes in Computer Science.
Bibliographic details on Feature Construction for Reinforcement Learning in Hearts.
May 31, 2006 · Hearts. • Trick-based card game. • Want to minimize your points. • One point for every heart (♥). • 13 points for Q♤.
In this study, the input is text-based, so construction of features has a crucial importance. Selecting the right set of information and utiliz- ing it ...