64.
The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.

67.
A completely automated chess engine (Learn from previous games) is based on?

68.
The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base.