Searching game trees under a partial order (Q2674204): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0004-3702(94)00085-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1993339151 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An analysis of alpha-beta pruning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multi-player alpha-beta pruning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Shortest paths without a map / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiobjective A* / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A minimax algorithm better than alpha-beta? / rank | |||
Normal rank |
Latest revision as of 04:19, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Searching game trees under a partial order |
scientific article |
Statements
Searching game trees under a partial order (English)
0 references
22 September 2022
0 references