!7

sS theRiddle = [[

  What is Fibonacci number 0?
  What is Fibonacci number 1?
  What is Fibonacci number 2?
  What is Fibonacci number 3?
  
]];

sS theFacts = [[
  Fibonacci number n is Fibonacci number n-1 plus Fibonacci number n-2 if n > 2.
  There is no Fibonacci number with a negative index.
  There is no Fibonacci number 0.
  Fibonacci number 1 is 1.
  Fibonacci number 2 is 1.
  
  gmtzfidalveipfyx feyhbrhdeovmbvaw amcmxkgwhivbouqs
]];

static L<S> priorityConcepts = ll(
  "mtsrzasaoxrmicch" // "X is Y if Z."
);

!include #1007689 // Web v2

static L<Lisp> facts;

p-tt {
  centerConsole();
  substance();
  aiEnhancements();
  aiConcepts_noAutoClear();
  //useConceptsDump(concepts);
  set englishToConceptLanguage_useBrackets;
  facts = clParse(printNumberedLines(linesToCL(theFacts)));
  useFacts(theFacts);
  printNumberedLines(facts);
  print();
  
  for (S rid : toLinesFullTrim(theRiddle)) {
    print("? " + rid);
    Lisp riddle = clParse(englishToConceptLanguage(rid));
    //print("# " + riddle);
    
    // Make web
    new Web web;
    web.relations(facts);
    web_expandMarkers(web);
    
    for (Lisp rule : trueStatementsByHead("mtsrzasaoxrmicch")) {
      Lisp x = rule.get(0);
      for (WebNode node : web.nodes) {
        for (Lisp lbl : node.labels) {
          print("Matching " + x + " and " + lbl);
          Map<S, Lisp> matches = lispMatch(x, lbl, ll("n"));
          if (matches != null)
            print("Rule match: " + struct(matches));
        }
      }
      //Lisp condition = rule.get(2);
      //print("Node: " + node + ", condition: " + condition);
    }
    
    // Answer question
    if (riddle.is("urfkhwfasdaqqqse", "mrhggsmuykeceghd")) { // What is X? // What is the decimal representation of X?
      Lisp x = riddle.get(0);
      L<Lisp> l = listWithout(web.findNode(x).labels, x);
      //print("Labels: " + l);
      S s = chooseALabelToReturn(l);
      print("  " + or2(conceptLanguageToEnglish(unquote(s)), "I don't know"));
    }
    //print(web);
  }
  
  aiUsing_print();
}

sS chooseALabelToReturn(L<Lisp> ll) {
  L<S> l = map(f clUnparse, ll);
  print("  Labels: " + l);
  S s = findInteger(l);
  if (s == null) s = firstGlobalID(l);
  //if (s == null) s = random(l);
  if (s == null) ret s = first(l);
  ret s;
}

static L<AIConcept> aiConceptsPrioritized() {
  new L<AIConcept> l;
  for (S id : priorityConcepts) {
    AIConcept c = getAIConcept(id);
    if (c == null) print("Warning: Not found " + id);
    addIfNotNull(l, c);
  }
  Set<S> index = new HashSet(priorityConcepts);
  for (AIConcept c : aiConceptsByAge())
    if (!index.contains(c.globalID))
      l.add(c);
  ret l;
}