Consider a map of Europe with only France, Germany, Spain, Portugul, 
Switzerland, Italy, Poland, Ireland, and the United Kingdom.

Make me a definition for connected(X,Y) such that...
connected(france, germany) -> yes
connected(portugul, poland) -> yes
connected(ireland, italy) -> false


Make a definition for path(X,Y,P) such that ...
path(germany, france, Z) -> Z = [germany, france]).
path(portugul, poland, Z) -> Z = [portugul, france, germany, poland]).
path(germany, ireland, Z) -> no

If connected works, +2 points.
If path finds a path between any two touching nation,  +1 point.
If path finds any path between any two connected nation, +1 point.
If path finds all paths between any two connected nation, +1 point.
If path finds all non-loopy paths between any two connected nation, +1 point.
If path has an infinite loop, -1 point.