|
|
|
My Pages at FUN |
|---|
|
|
|
Projects |
|
Search in FINESSE FINESSE searches by building trees composed of its tactics. The resulting trees are many orders of magnitude smaller than the object-level search of considering each card play. The best branch selections in the tree are determined by an algorithm that uses a qualatative language to represent uncertainty. FINESSE has efficient rules for manipulating this language and can translate any expression into either a probability or a textual explanation. The state of the search at any point in the tree can be examined by clicking on the corresponding node in the graphical interface. |
||||
|
![[Screen capture of
search tree produce by FINESSE]](../Image/enc1.gif)
|
