{ "item_title" : "Computer Games", "item_author" : [" Tristan Cazenave", "Mark H. M. Winands", "Yngvi Björnsson "], "item_description" : "Minimizing simple and cumulative regret in Monte-Carlo tree search.- on robustness of CMAB algorithms.- Experimental approach.- Job-level algorithms for Connect6 opening position analysis.- Monte-Carlo tree search and minimax hybrids with heuristic evaluation functions.- Monte-Carlo tree search for the game of 7 Wonders.- Small and large MCTS playouts applied to Chinese Dark Chess Stochastic Game.- On the complexity of general game playing.- Efficient grounding of game descriptions with tabling.- SHPE: HTN planning for video games.- Predicting player disengagement in online games.- Coordinating dialogue systems and stories through behavior composition.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/31/914/922/3319149229_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details