added 2nd assignment AI

Author: Simon

Artificial Intelligence/manhattan.pl

@@ -0,0 +1,10 @@
+gtp(1,1,1). gtp(2,1,2). gtp(3,1,3). gtp(4,2,3). gtp(5,3,3). gtp(6,3,2). gtp(7,3,1). gtp(8,2,1). gblnk(2,1).
+tp(1,1,2). tp(2,1,3). tp(3,2,1). tp(4,2,3). tp(5,3,3). tp(6,2,2). tp(7,3,2). tp(8,1,1). blnk(3,1).
+
+go:- calcH(1,[],L), sumList(L,V),write('Heuristics: '),write(V).
+calcH(9,X,X):-!.
+calcH(T,X,Y):- dist(T,D), append(X,[D],X1), T1 is T+1, calcH(T1,X1,Y).
+dist(T,V):-tp(T,A,B), gtp(T,C,D), V is abs(A-C) + abs(B-D).
+sumList([],0):-!.
+sumList(L,V):-L=[H|T], sumList(T,V1), V is V1+H.
+

Artificial Intelligence/manhattan.py

@@ -0,0 +1,11 @@
+gtp=[(1,1,1), (2,1,2), (3,1,3), (4,2,3), (5,3,3), (6,3,2), (7,3,1), (8,2,1)]
+gblnk = (2,1)
+tp=[(1,1,2), (2,1,3), (3,2,1), (4,2,3), (5,3,3), (6,2,2), (7,3,2), (8,1,1)]
+blnk = (3,1)
+
+# Procedure to find the manhattan distance
+i,h=0,0
+while(i<=7):
+    h = h + abs(tp[i][1] - gtp[i][1]) + abs(tp[i][2] - gtp[i][2])  
+    i=i+1
+print('Heuristics : ',h)

Artificial Intelligence/numberOfAttackingPairs.py

@@ -0,0 +1,15 @@
+queens = [(1, 2), (1, 8), (3, 6), (4, 5), (5, 3), (6, 1), (7, 4), (8, 7)]
+
+count = 0
+for i in range(8):
+    for j in range(8):
+        #checking in right side
+        if queens[j][1] > queens[i][1] :
+            #checking horizontally
+            if queens[i][0] == queens[j][0]:
+                count += 1
+            #checking diagonally
+            elif abs(queens[j][0] - queens[i][0]) == abs(queens[j][1] - queens[i][1]):
+                count += 1
+
+print('Heuristics : ', count)

Artificial Intelligence/pathLength.pl

@@ -0,0 +1,7 @@
+neighbor(i,a,35). neighbor(i,b,45). neighbor(a,c,20).
+neighbor(a,d,30). neighbor(b,d,25). neighbor(b,e,35).
+neighbor(b,f,27). neighbor(c,d,30). neighbor(c,g,47).
+neighbor(d,g,30). neighbor(e,g,25).
+
+pathLength(X,Y,L):- neighbor(X,Y,L),!.
+pathLength(X,Y,L):- neighbor(X,Z,L1), pathLength(Z,Y,L2), L is L1+L2.

Artificial Intelligence/pathLength.py

@@ -0,0 +1,25 @@
+def pathLength(x, y):
+    i = 0
+    s = 0
+    for i in range(len(neighbour)):
+        if neighbour[i][0] == x:
+            z = neighbour[i][1]
+            if z == y:
+                return neighbour[i][2]
+            elif pathLength(z, y) != -1:
+                return neighbour[i][2] + pathLength(z, y)
+            else:
+                continue
+    return -1
+
+            
+#main
+
+neighbour = [('i', 'a', 35), ('i', 'b', 45), ('a', 'c', 20), ('a', 'd', 30),
+             ('b', 'd', 25), ('b', 'e', 35), ('b', 'f', 27), ('c', 'd', 30),
+             ('c', 'g', 47), ('d', 'g', 30), ('e', 'g', 25)]
+
+print("input the vertices : ")
+x = input()
+y = input()
+print(pathLength(x, y))

Artificial Intelligence/sumOfNTerms.pl

@@ -0,0 +1,2 @@
+ssum(0, _, _, 0):-!.
+ssum(N, I, F, S) :- N1 is N-1, ssum(N1, I, F, S1), S is S1+F+(N-1) * I.

Artificial Intelligence/sumOfNTerms.py

@@ -0,0 +1,13 @@
+def ssum(N,I,F):
+    if (N==0):
+        return 0
+    elif (N>=1):
+        return ssum(N-1,I,F)+F+(N-1)*I
+# Main
+t=int(input('How many times?'))
+for i in range(t):
+    print('Iteration:',i+1)
+    f=int(input('First element:'))
+    d=int(input('Interval:'))
+    n=int(input('n:'))
+    print('Series sum:', ssum(n,d,f))