Negamax

Known as: Nega-max

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…

Papers overview

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

2017

2015

A study was conducted to evaluate the effects of feeding processed kidney bean meal (PKBM) by replacing soybean meal (SBM) on…

2013

2008

In this paper we consider the class of truth-functional modal many-valued logics with the complete lattice of truth-values. The…

2008

Obese women (BMI>30 kg/m ) were found to have high er total cholesterol (total-C) (pO.01) and triglyceride (TG) levels (pO.OOl…

2004

The life-and-death problem in Go is a basic and essential problem to be overcome in implementing a computer Go program. This…

2003

KRATAK SADRŽAJ: Struk tur ne ce re bral ne ano ma li je, ve li ka uee sta lost pre na tal nih i pe ri na tal nih kom pli ka ci ja…

2001

This is a comment to the preceding letter [R. E. Apfel, J. Acoust. Soc. Am. 110, 1740 (2001)].

1996

Semantics Many concrete semantics have been defined by selecting either a specific model of every logic program (such as the well…

1989

Since there existed no convincing theoretical explanation for the usually observed benefits of minimax search in practice, we…