Comparative study of performance of parallel Alpha Beta Pruning for different architectures

08/30/2019
by   Shubhendra Pal Singhal, et al.
0

Optimization of searching the best possible action depending on various states like state of environment, system goal etc. has been a major area of study in computer systems. In any search algorithm, searching best possible solution from the pool of every possibility known can lead to the construction of the whole state search space popularly called as minimax algorithm. This may lead to a impractical time complexities which may not be suitable for real time searching operations. One of the practical solution for the reduction in computational time is Alpha Beta pruning. Instead of searching for the whole state space, we prune the unnecessary branches, which helps reduce the time by significant amount. This paper focuses on the various possible implementations of the Alpha Beta pruning algorithms and gives an insight of what algorithm can be used for parallelism. Various studies have been conducted on how to make Alpha Beta pruning faster. Parallelizing Alpha Beta pruning for the GPUs specific architectures like mesh(CUDA) etc. or shared memory model(OpenMP) helps in the reduction of the computational time. This paper studies the comparison between sequential and different parallel forms of Alpha Beta pruning and their respective efficiency for the chess game as an application.

READ FULL TEXT
research
05/07/2015

Best-First and Depth-First Minimax Search in Practice

Most practitioners use a variant of the Alpha-Beta algorithm, a simple d...
research
11/08/2019

A different take on the best-first game tree pruning algorithms

The alpha-beta pruning algorithms have been popular in game tree searchi...
research
04/05/2014

SSS* = Alpha-Beta + TT

In 1979 Stockman introduced the SSS* minimax search algorithm that domi-...
research
02/11/2017

A Minimax Algorithm Better Than Alpha-beta?: No and Yes

This paper has three main contributions to our understanding of fixed-de...
research
04/19/2023

Network Pruning Spaces

Network pruning techniques, including weight pruning and filter pruning,...
research
09/27/2011

An Improved Search Algorithm for Optimal Multiple-Sequence Alignment

Multiple sequence alignment (MSA) is a ubiquitous problem in computation...
research
06/21/2011

Symmetry-Based Search Space Reduction For Grid Maps

In this paper we explore a symmetry-based search space reduction techniq...

Please sign up or login with your details

Forgot password? Click here to reset