Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game. This algorithm relies on the fact that… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Ahmed A. Elnaggar, Mahmoud E. A. Gadallah, Mostafa Abdel Aziem, H. M. El-Deeb
- 2014 IEEE International Conference on Progress in…
- 2014

Parallel performance for GPUs today surpasses the traditional multi-core CPUs. Currently, many researchers started to test… (More)

Is this relevant?

2014

2014

- Xiali Li, Liang Hou, Licheng Wu
- The 26th Chinese Control and Decision Conference…
- 2014

The main difficulty of Amazons games is the huge branch factor. Traditional NegaMax Search and Alpha-Beta Search can only search… (More)

Is this relevant?

2012

2012

- Ashraf M. Abdelbar
- Algorithms
- 2012

The minimax algorithm, also called the negamax algorithm, remains today the most widely used search technique for two-player… (More)

Is this relevant?

2011

2011

- Dmitrijs Rutko
- MICAI
- 2011

Fuzzified game tree search algorithm is based on the idea that the exact game tree evaluation is not required to find the best… (More)

Is this relevant?

1995

1995

- Warren D. Smith
- 1995

| Consider a rooted tree with branching factor b > 1 having b h leafs, each at distance h from the root. Suppose the leafs are… (More)

Is this relevant?

1991

1991

- Ahmad Ghafarian
- SIGCSE
- 1991

This paper outlines the application of a generalpurpose software package, a tool for distributed backtrack programming (TDBP… (More)

Is this relevant?

1990

1990

- Ingo Althöfer
- Artif. Intell.
- 1990

In certain models o f game trees with erroneous evaluation functions the minimax algorithm does not reduce errors, even under… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- Raphael A. Finkel, Udi Manber
- ICDCS
- 1985

DIB is a general-purpose package that allows a wide range of applications such as recursive backtrack, branch and bound, and… (More)

Is this relevant?

1983

1983

- T. Anthony Marsland
- IJCAI
- 1983

Most of the data on the relat ive efficiency of dif ferent implementations of the alpha-beta a l gorithm is neither readily… (More)

Is this relevant?

1980

1980

- John P. Fishburn
- SIGART Newsletter
- 1980

Most computer programs that play games like chess choose moves by searching a lookahead tree of possible continuations. After… (More)

Is this relevant?