[hl=delphi]
// Find the best move at the first active root position in an IDeA tree
// Run this script in IDeA project view
var
  proj: TIDeAProjectInfo;  // IDeA project information
  t:TSTreeScanner;         // For scanning/searching the IDeA tree
  ni:TSnodeinfo;           // Information about a node in the tree
  Pos:string;              // The FEN of the position we are searching for
  mi: TSMoveinfo;          // Move information
  root: TIDeARootNode;     // An IDeA root node
  RootList: TObjectList;   // A list of all root nodes in the project
  i : integer;
begin
  proj := GetCurrentProject;  // Information about the current project
  if not Assigned(proj) then Exit; // Shouldn't happen, but just in case

  RootList := proj.RootNodes; // All project root nodes (both active and inactive)
  if RootList = nil then   // Empty root node list
  begin
    print('There are no root nodes defined in this project');
    Exit;
  end;
  for i := 0 to RootList.Count - 1 do  // Search the root list for an active root
    if TIDeARootNode(RootList.Items[i]).Enabled then break;  // Active root found
  if i > RootList.Count - 1 then  // No active root
  begin
    Print('There are no active roots in this project');
    Exit;
  end;
  root:= TIDeARootNode(RootList.Items[i]); // The first active root node
  Pos:= root.FEN; // The FEN of the first active root node

  ideatree:=GetCurrentProject.AnalysisTreeName;  // The project tree name
  fulltree:=DataPath+'ATrees\'+ideatree+'.hsh';  // The fully qualified project tree name
  t:= TSTreeScanner.Create(fulltree);  // Used for scanning/searching the tree
  if t.Opened then  // Project tree successfully opened
    begin
      ni:=t.SearchFEN(Pos);  // Search for the root position in the tree
      if ni <> nil then      // Position found in the tree
        begin
          if ni.Count > 0 then  // There are moves available at this node
          begin
            mi:=ni.Moves[ni.Sorted[0]];  // The highest scoring move
            Print('Best move: ' + mi.Move);  // The move itself
            Print('Bestmove score: ' + inttostr(mi.Score));  // The percentage score
            Print('Bestmove cpscore: ' + inttostr(mi.CPScore));  // Centipawn score
          end;
          else
            Print('No moves available for this root node');
        end;
      else
        Print('Root node not found in tree');
    end;
  else
    Print('Couldn''t open project tree');
  t.Free();    
end.