ScholarIQanswers from OpenAlex

Efficiency of parallel minimax algorithm for game tree search

PaperCitations, authors & open-access status

Efficiency of parallel minimax algorithm for game tree search is a paper indexed in ScholarIQ from OpenAlex.

How many citations does Efficiency of parallel minimax algorithm for game tree search have?

ScholarIQcitation count

Efficiency of parallel minimax algorithm for game tree search has 23 citations in the OpenAlex counts ScholarIQ stores.

When was Efficiency of parallel minimax algorithm for game tree search published?

ScholarIQyear

Efficiency of parallel minimax algorithm for game tree search has 2007 year in the ScholarIQ index.

What is the open-access status of Efficiency of parallel minimax algorithm for game tree search?

ScholarIQoa status

Efficiency of parallel minimax algorithm for game tree search has closed oa status in the ScholarIQ index.

What is the DOI of Efficiency of parallel minimax algorithm for game tree search?

ScholarIQdoi

The DOI for Efficiency of parallel minimax algorithm for game tree search is on the source record.

What is the OpenAlex record for Efficiency of parallel minimax algorithm for game tree search?

ScholarIQopenalex

The OpenAlex for Efficiency of parallel minimax algorithm for game tree search is on the source record.

Related on ScholarIQ

470M+ articles · 14-day free trial