Consider a map of Europe with only Cyprus, Northern Cyprus, Jordan,Iran, Iraq, Syria,Lebanon, Israel, Egypt, Kuwait, Palestine, and Turkey.

Make me a definition for connected(X,Y) such that...
connected(iran, iraq) -> yes
connected(egypt, syria) -> yes
connected(cyprus, iraq) -> false


Make a definition for path(X,Y,P) such that ...
path(lebanon, syria, Z) -> Z = [lebanon, syria]).
path(egypt, iraq, Z) -> Z = [egypt,israel,jordan,iraq]).
path(israel,northerncyprus, Z) -> no

If connected works, +4 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.