(algorithm) | A* search - A graph search algorithm. A* is guaranteed to
find a minimal solution path before any other solution paths,
if a solution exists, in other words, it is an "admissible"
search algorithm. Each path is assigned a value based on the
cost of the path (e.g. its length) and an (under)estimate of
the cost of completing the path, i.e. the cost of a path from
the end of the current path to a solution. |

Browse

a trillion

A true bill

A verbis legis non est recedendum

A vinculo matrimonii

A Visit from St. Nicholas

A wet blanket

A wheel within a wheel

A whited sepulcher

A wild goose chase

A world to see

A year's mind

a zillion

A#

A&B

A'man

A'UM

**-- A* search --**

A-

A-0

A-3

A-bomb

A-COPS

A-horizon

A-LAN

A-language

A-law

A-Life

A-list

A-mornings

a-ok

a-okay

A-one

A-sea

A true bill

A verbis legis non est recedendum

A vinculo matrimonii

A Visit from St. Nicholas

A wet blanket

A wheel within a wheel

A whited sepulcher

A wild goose chase

A world to see

A year's mind

a zillion

A#

A&B

A'man

A'UM

A-

A-0

A-3

A-bomb

A-COPS

A-horizon

A-LAN

A-language

A-law

A-Life

A-list

A-mornings

a-ok

a-okay

A-one

A-sea