# Efficiency of parallel minimax algorithm for game tree search

**Type:** Papers  
**Canonical URL:** https://scholariq.org/papers/efficiency-of-parallel-minimax-algorithm-for-game-tree-search/

## Facts

| Field | Value |
| --- | --- |
| Author Names | Plаmеnkа Borovskа,Milena Lazarova |
| Citations | 23 |
| DOI | 10.1145/1330598.1330615 |
| Fields | Computer Science,Social Sciences |
| Open Access | false |
| OA Status | closed |
| OpenAlex ID | https://openalex.org/W2025856884 |
| Type | conference-abstract |
| Year | 2007 |

## Paper authors

- [Milena Lazarova](https://scholariq.org/researchers/milena-lazarova/)

## Paper primary topic

- [Artificial Intelligence in Games](https://scholariq.org/topics/artificial-intelligence-in-games/)

## Paper topics

- [Artificial Intelligence in Games](https://scholariq.org/topics/artificial-intelligence-in-games/)
- [Digital Games and Media](https://scholariq.org/topics/digital-games-and-media/)
- [Evolutionary Algorithms and Applications](https://scholariq.org/topics/evolutionary-algorithms-and-applications/)

---
Source: ScholarIQ — public research metadata, principally OpenAlex. See https://scholariq.org/sources/ for provenance and https://scholariq.org/methodology/ for what these figures mean.