{"product_id":"139032","title":"Introduction to Search Algorithms for Game AI ","description":"\u003ccenter\u003e\u003cdiv style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/tmgdisk01.cafe24.com\/images\/vs\/4172\/sv\/3jXPBvrrzwOIGjumRqEGyPlKs2qD2Y.png?v=1765072248\" style=\"max-width:100%;max-height:10px\"\u003e\u003c\/div\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\u003ccenter\u003e\n\n\u003cdiv style=\"width:95%\"\u003e\n\n\u003cdiv style=\"text-align:center;font-size:30px;font-weight:bolder;line-height:1.6em\"\u003e Introduction to Search Algorithms for Game AI \u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"border-bottom:1px;border-bottom-style:dotted;border-color:;padding-bottom:20px\"\u003e\u003ccenter\u003e\u003ctable align=\"center\" width=\"100%\"\u003e\u003ctbody style=\"border:0px\"\u003e\n\n\u003ctr\u003e\u003ctd align=\"center\" style=\"line-height:1.2em;text-align:center;font-size:18px;color:black;font-weight:bold;padding-bottom:20px;\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\u003ctr\u003e\u003ctd style=\"text-align:center\"\u003e\u003cimg src=\"https:\/\/image.yes24.com\/goods\/125230335\/XL\" style=\"max-width:100%;height:auto\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\n\n\n\u003c\/tbody\u003e\u003c\/table\u003e\u003c\/center\u003e\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;{split_style6}padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e Description \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;word-break:break-all;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eBook Introduction\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e\u003cdiv\u003e \u003cb\u003eFrom the theory of search algorithms essential to game AI to their practical application in real games.\u003cbr\u003e Provides C++-based example code for implementing real-world AI games.\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e \"Introduction to Search Algorithms for Game AI\" covers \"search,\" one of the core elements of game AI technology.\u003cbr\u003e Search is a term that refers to game tree search in combinatorial game theory and metaheuristics using combinatorial optimization.\u003cbr\u003e This book explains how to prepare a C++ development environment and how to use search algorithms appropriate for single-player games, such as predicting player behavior or utilizing combinatorial optimization.\u003cbr\u003e We also look at search algorithms that are suitable for games where the next move is completely unpredictable, such as two-player games like Janggi or Baduk, where the players take turns playing, or two-player games where the players play simultaneously. \u003cbr\u003eIn the first half, we introduced algorithms suitable for each game type, and in the second half, we learn about algorithms for better exploration and how to utilize them in real-world situations.\u003cbr\u003e Develop practical skills by implementing and strengthening an AI that plays 'Connect for'.\u003cbr\u003e\u003cbr\u003e\n\u003c\/div\u003e\u003c\/div\u003e\n\u003cdiv\u003e\u003cul\u003e\u003cli\u003e You can preview some of the book's contents.\u003cbr\u003e \u003cspan\u003ePreview\u003c\/span\u003e\n\n\u003c\/li\u003e\u003c\/ul\u003e\u003c\/div\u003e\n\u003c\/div\u003e \",\"\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eindex\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\n\u003cdiv\u003e \u003cb\u003eChapter 1: The World of Games and Exploration\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e 1.1 Game AI and Exploration\u003cbr\u003e __1.1.1 AI and Exploration in the Game\u003cbr\u003e __1.1.2 Game Types and Search Algorithms\u003cbr\u003e 1.2 The allure of exploration in games\u003cbr\u003e __1.2.1 Explore if you are developing a personal game!\u003cbr\u003e __1.2.2 Exploring large-scale commercial game development!\u003cbr\u003e __1.2.3 A secret weapon to win various programming competitions\u003cbr\u003e\u003cbr\u003e \u003cb\u003eChapter 2: Preparing the Development Environment\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e 2.1 How to install WSL (Windows Subsystem for Linux)\u003cbr\u003e __2.1.1 Checking WSL operation\u003cbr\u003e __2.1.2 Check CPU virtualization function  \u003cbr\u003e__2.1.3 Enabling virtualization in BIOS\/UEFI\u003cbr\u003e __2.1.4 Distribution Settings\u003cbr\u003e __2.1.5 package update\u003cbr\u003e __2.1.6 Installing the C++ Development Environment\u003cbr\u003e\u003cbr\u003e \u003cb\u003eChapter 3: Search Algorithms You Want to Use in a Contextual, Single-Player Game\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e 3.1 Introduction to the Example Game: Number Collection Maze Game\u003cbr\u003e __3.1.1 Number Collection Maze Game\u003cbr\u003e __3.1.2 Implementing a number-collecting maze game\u003cbr\u003e 3.2 Greedy Algorithm\u003cbr\u003e __3.2.1 Greedy Algorithm Features and Operation: The Foundation of All Search Algorithms! With this, you can fight!\u003cbr\u003e __3.2.2 Implementing a Greedy Algorithm\u003cbr\u003e 3.3 Beam Search\u003cbr\u003e __3.3.1 Characteristics and Operation of Beam Search: Understand the Search Space! A Search Method Frequently Featured in Top Competitions!\u003cbr\u003e __3.3.2 Implementing beam search\u003cbr\u003e Changes to the way COLUMN beam search is implemented\u003cbr\u003e 3.4 Chokudai Exploration\u003cbr\u003e __3.4.1 Features and Operations of Chokudai Search: Automatically Secures Diversity! Easy and Recommended for Beginners!\u003cbr\u003e __3.4.2 Implementing Chokudai Search\u003cbr\u003e  \u003cbr\u003e\u003cb\u003eChapter 4: Search Algorithms You Want to Use in Context-Free, Single-Player Games\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e 4.1 Introduction to the Example Game: Automatic Number Collection Maze Game\u003cbr\u003e __4.1.1 Number Collecting Maze Game\u003cbr\u003e __4.1.2 Implementing an automatic number-collecting maze\u003cbr\u003e 4.2 Hill Climb Navigation\u003cbr\u003e __4.2.1 Hill Climbing Search: Features and Operations: Steadily Searching for Good Solutions! A Simple and Reliable Algorithm!\u003cbr\u003e __4.2.2 Implementing Hill Climb Search\u003cbr\u003e 4.3 Pickling Techniques\u003cbr\u003e __4.3.1 Characteristics and Operation of the Pickling Technique: Breaking Out of Local Optimal Solutions! An Algorithm Familiar with Marathon Matches!\u003cbr\u003e __4.3.2 Implementing the pickling technique\u003cbr\u003e COLUMN Metaheuristics\u003cbr\u003e\u003cbr\u003e \u003cb\u003eA search algorithm that you would like to use in a two-player game where you alternate between 5 players.\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e 5.1 Introduction to the Example Game: Alternating Number Collection Maze Game\u003cbr\u003e __5.1.1 Alternating Number Collection Maze Game\u003cbr\u003e __5.1.2 Implementing a maze that collects alternating numbers\u003cbr\u003e 5.2 Minimax Algorithm  \u003cbr\u003e__5.2.1 Characteristics and Operation of the Minimax Algorithm: A Masterstroke!\u003cbr\u003e __5.2.2 Implementing the Minimax Algorithm\u003cbr\u003e 5.3 Alpha-Beta Pruning\u003cbr\u003e __5.3.1 Alpha-Beta Pruning: Characteristics and Operations: Waste is Unforgivable! The Evolution of the Minimax Algorithm!\u003cbr\u003e COLUMN The Relationship Between the Minimax Algorithm and Alpha-Beta Pruning\u003cbr\u003e __5.3.2 Implementing Alpha-Beta Pruning\u003cbr\u003e\u003cbr\u003e 5.4 Iterative Deepening Exploration\u003cbr\u003e __5.4.1 Features and Operations of Iterative Deepening Search: No Time to Waste! Find the Optimal Tree Depth!\u003cbr\u003e __5.4.2 Implementing iterative deepening search\u003cbr\u003e 5.5 Pure Monte Carlo Search\u003cbr\u003e __5.5.1 Features and behavior of pure Monte Carlo search: No need to evaluate the board! Just choose the move with the best chance of winning!\u003cbr\u003e COLUMN Exploring Monte Carlo and Las Vegas\u003cbr\u003e __5.5.2 Implementing Pure Monte Carlo Search\u003cbr\u003e 5.6 MCTS Monte Carlo Tree Search\u003cbr\u003e __5.6.1 MCTS Features and Operations: Don't Underestimate Your Enemy! A Simulation of the Battle of the Strong\u003cbr\u003e __5.6.2 Implementing MCTS\u003cbr\u003e 5.7 Thunder Exploration \u003cbr\u003e__5.7.1 Features and Operations of Thunder Exploration: Invented by the Author! Uses board evaluation to explore advantageous nodes!\u003cbr\u003e __5.7.2 Implementing Thunder Navigation\u003cbr\u003e COLUMN How was Thunder Navigation created?\u003cbr\u003e\u003cbr\u003e \u003cb\u003eA search algorithm that you would like to use in a two-player game where you place six cards simultaneously.\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e 6.1 Introduction to the Example Game: A Simultaneous Number Collection Maze Game\u003cbr\u003e __6.1.1 Simultaneous Number Collection Maze Game\u003cbr\u003e __6.1.2 Implementing a simultaneous number collection maze\u003cbr\u003e 6.2 Algorithm application for alternating games\u003cbr\u003e __6.2.1 Implementing Pure Monte Carlo Search\u003cbr\u003e __6.2.2 Implementing MCTS\u003cbr\u003e 6.3 DUCT(Decoupled Upper Confidence Tree)\u003cbr\u003e __6.3.1 DUCT's features and operation: If you're looking for a game that puts things in place at the same time, this is it!\u003cbr\u003e __6.3.2 Implementing DUCT\u003cbr\u003e\u003cbr\u003e \u003cb\u003eChapter 7: Techniques for Better Exploration\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e 7.1 Introduction to the Example Game: A Number-Collecting Maze with Walls\u003cbr\u003e __7.1.1 Number Collecting Maze Game with Walls\u003cbr\u003e __7.1.2 Implementing a number-collecting maze with walls\u003cbr\u003e 7.2 Designing an Evaluation Function \u003cbr\u003e__7.2.1 Adding candidate scores other than actual recorded scores\u003cbr\u003e __7.2.2 Implementing a method to add auxiliary record scores other than the actual record scores\u003cbr\u003e 7.3 Diversity Policy\u003cbr\u003e __7.3.1 Removing the same game board\u003cbr\u003e __7.3.2 Implementing Same Game Board Removal\u003cbr\u003e 7.4 High-speed\u003cbr\u003e __7.4.1 Representing the game board as multiple bit strings\u003cbr\u003e __7.4.2 Implementing a game board representation using multiple bit strings\u003cbr\u003e __7.4.3 Representing the game board as a single bit string\u003cbr\u003e __7.4.4 Implementing a Game Board Representation Using a Single Bit String\u003cbr\u003e __7.4.5 Controlling the number of copies\u003cbr\u003e __7.4.6 Implementing copy count control using reference counting\u003cbr\u003e\u003cbr\u003e \u003cb\u003eChapter 8: Applying it to Real Games\u003c\/b\u003e\u003cbr\u003e\u003cbr\u003e 8.1 Implementing AI that Plays Connect for Games\u003cbr\u003e __8.1.1 Connect for Games\u003cbr\u003e __8.1.2 Implementing Connect for\u003cbr\u003e __8.1.3 Speeding up the game board using the bitboard\u003cbr\u003e __8.1.4 Implementing bitwise operations on connect four\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e \",\"\u003cdiv\u003e\u003ch5\u003e \u003cb\u003eDetailed image\u003c\/b\u003e \u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e\u003cdiv\u003e\u003cimg src=\"https:\/\/image.yes24.com\/momo\/TopCate4433\/MidCate007\/443268113.jpg\" border=\"0\" alt=\"Detailed Image 1\"\u003e\u003c\/div\u003e\u003c\/div\u003e \",\"\u003cdiv\u003e\u003ch5\u003e \u003cb\u003ePublisher's Review\u003c\/b\u003e\n\u003c\/h5\u003e\u003c\/div\u003e\n\u003cdiv\u003e  \u003cdiv\u003eThis book introduces the fundamental concepts of search algorithms, an essential core element of game AI, and examines search algorithms suited to different game types.\u003cbr\u003e We'll explore algorithms that can be applied to a variety of games, as well as algorithms developed by the author himself, who has won numerous competitions.\u003cbr\u003e Additionally, the C++-based example code is kindly explained through comments, and is structured in a way that even beginners can easily understand through the COLUMN and POINT structure.\u003cbr\u003e Additionally, we provide template code that can be used in practice, systematically conveying the theory and know-how required for game AI development.\u003cbr\u003e\n\n\u003c\/div\u003e\n\u003cdiv\u003e\u003c\/div\u003e\n\u003c\/div\u003e \"]\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cdiv style=\"width:95%;padding-top:20px;padding-bottom:20px\"\u003e\n\n\u003cdiv style=\"text-align:left;font-size:16px;font-weight:bold;padding-bottom:20px\"\u003e GOODS SPECIFICS \u003c\/div\u003e\n\n\u003cdiv style=\"text-align:left;font-size:14px;line-height:1.6em;\"\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eDate of issue:\u003c\/strong\u003e March 8, 2024\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003ePage count, weight, size:\u003c\/strong\u003e 344 pages | 183*235*30mm\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN13:\u003c\/strong\u003e 9791169212038\u003c\/div\u003e\n\n\u003cdiv style=\"width:100%;margin-bottom:5px;line-height:1.6em;font-size:14px\"\u003e - \u003cstrong\u003eISBN10:\u003c\/strong\u003e 1169212034 \u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\n\u003c\/div\u003e\n\n\u003ccenter\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003ccenter\u003e\u003ctable\u003e\u003ctr\u003e\u003ctd style=\"height:10px\"\u003e\u003c\/td\u003e\u003c\/tr\u003e\u003c\/table\u003e\u003c\/center\u003e\n\n\u003cspan\u003e\u003c\/span\u003e\n\n\u003c\/center\u003e\n\n\n\u003c\/center\u003e","brand":"LIBRAIRIE COREENNE","offers":[{"title":"Default Title","offer_id":43893337391146,"sku":"139032","price":37.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0683\/2750\/5962\/files\/2b633051f0ad19ce60d6797c0f5c6d68.jpg?v=1765397047","url":"https:\/\/librairie.coreenne.fr\/en\/products\/139032","provider":"LIBRAIRIE COREENNE","version":"1.0","type":"link"}