Parallelization of Node Based Game Tree Search Algorithm on GPU
GTS is directed graph whose nodes indicates position and edges indicates moves in a game theory. Game tree is the hierarchical tree structure begins at the initial position as a node and contains all possible moves from each position. Game tree search algorithm is used to search the best move in game tree. GTS is a combinatorial problem in which it is hard to find optimal solution from huge possible solutions. In literature, finding a better GTS algorithm to obtain best solution and use of advanced computing architectures to speed up the GTS computation are mostly studied.
Subscribe to the Innovation Insider Newsletter
Catch up on the latest tech innovations that are changing the world, including IoT, 5G, the latest about phones, security, smart cities, AI, robotics, and more. Delivered Tuesdays and Fridays