AI Lab File
22
Artificial Intelligence Lab file Atishay Jain
-
Upload
atishay-jain -
Category
Documents
-
view
218 -
download
2
description
AI lab file Thapar university, Patiala.
Transcript of AI Lab File
Artificial Intelligence
Lab file
Atishay Jain107830174CO5
Index
S. No. Topic Page No
1 Breadth First Search 3
2 Depth First Search 3
3 Depth First Search with Iterative Deepening 5
4 Simple Hill Climbing 6
5 Steepest Ascent Hill Climbing 10
6 Best First Search 14
7 Tower of Hanoi 18
2
Program 1&2 : BFS & DFS
/******************************Name: Atishay Jain*Course: BE Final Year*Group: 4CO5*Subject: Artificial Intelligence*Prog: BFS & DFS*****************************/#include<stdio.h>int main(){
int n,i,j,x,s;int a[100][100];int stack[100]={0};int tos=0;int visited[100]={0};int next=0,flag=0;int queue[100];int front=0;int rear=0;int parent[100]={0};
do{// Program for dfs and bfsprintf("Please enter the number of nodes(<100):" );scanf("%d",&n);
}while(n>100);printf("Please enter the adjacency matrix:\n");for(i=0;i<n;i++){
for(j=0;j<n;j++){scanf("%d",&a[i][j]);}
}printf("Please enter the root:");scanf("%d",&x);x--;printf("Enter the elemnt no to be searched:");scanf("%d",&s);s--;printf("DFS traversal\n");stack[tos++]=x;visited[x]=1;flag=0;do{
next=stack[--tos];if(next==s){
flag=1;printf("%d",next+1);break;
}printf("%d->",next+1);for(i=0;i<n;i++)
3
{if(a[next][i]==1){
if(visited[i]==0){
stack[tos++]=i;visited[i]=1;
}}
}}while(tos!=0);if(flag!=1){
printf("\n It is not possible to reach the destination.");}printf("\nBFS traversal:\n");queue[rear++]=x;visited[x]=-1;parent[x]=-1;flag=0;do{
next=queue[front++];if(next==s){
printf("%d",next+1);printf("\nShortest Route:");do{
printf("%d<-",next+1);next=parent[next];
}while(next!=x);printf("%d\n",x+1);flag=1;break;}printf("%d->",next+1);for(i=0;i<n;i++){
if(a[next][i]==1){
if(visited[i]!=-1){
visited[i]=-1;queue[rear++]=i;parent[i]=next;
}}
}}while(front!=rear);if(flag!=1){
printf("No route present.");}}
4
Program 3: DFS with Iterative Deepening
/******************************Name: Atishay Jain*Course: BE Final Year*Group: 4CO5*Subject: Artificial Intelligence*Prog: DFS Iterative Deepening*****************************/#include<stdio.h>#include<conio.h>int main(){
int n,i,j,x,s;int a[100][100];int stack[100]={0};
int stops[100]={0};int tos=0;
int next=0,flag=0;int front=0;int rear=0;int parent[100]={0};
do{printf("Please enter the number of nodes(<100):" );scanf("%d",&n);
}while(n>100);printf("Please enter the adjacency matrix:\n");for(i=0;i<n;i++){
for(j=0;j<n;j++){scanf("%d",&a[i][j]);}
}printf("Please enter the root:");scanf("%d",&x);x--;printf("Enter the elemnt no to be searched:");scanf("%d",&s);s--;printf("DFS with iterative deepening traversal\n");int k=0,lk;while(1){tos=0;int visited[100]={0};stack[tos++]=x;stops[tos-1]=0;visited[x]=1;flag=0;do{
next=stack[--tos];lk=stops[tos+1];if(next==s && lk==k){
5
flag=1;printf("%d",next+1);break;
}if(lk==k)
{printf("%d->",next+1);}if(lk<=k){
for(i=0;i<n;i++){
if(a[next][i]==1){
if(visited[i]==0){
stack[tos++]=i;visited[i]=1;
}}
}}}while(tos!=0);if(flag==1) break;k++;printf("K=%d",k);if(k==100) break;};if(flag!=1){
printf("\n It is not possible to reach the destination.");}getch();}
Program 4: Simple Hill Climbing
/******************************Name: Atishay Jain*Course: BE Final Year*Group: 4CO5*Subject: Artificial Intelligence*Prog: Simple Hill Climbing for 8 Puzzle Problem*****************************/
#include<iostream>#include<conio.h>#include<cmath>using namespace std;
int start[3][3],final[3][3];
//Finds the position of the tile no tint findpos(int a[][3],int t){ for(int i=0;i<3;i++) {
6
for(int j=0;j<3;j++) {
if(a[i][j]==t) return (3*i+j+1);
} }
}
//Calculation of Heuristic: Distance from final stateint heurestic(int a[][3]){ int h=0,posi,posg; for(int i=1;i<=9;i++) {
posi=findpos(a,i); posg=findpos(final,i); h+=abs((float)posg-posi);
} return h;
}
//Matrix Displayvoid display(int a[][3]){
for(int i=0;i<3;i++){
cout<<"\n";for(int j=0;j<3;j++){
if(a[i][j] !=9 )cout<<a[i][j]<<"\t";else cout<<" \t";
}}
}
int main(){ int next[3][3]; int i ,j,hi,hf,hn, posi,posj,lftflags=0,rtflags=0, upflags=0, dwnflags=0,lftflagp=0,rtflagt=0, upflagp=0,dwnflagp=0; cout<<"\nEnter starting state(Enter 9 for blank):\n"; for(i=0;i<3;i++)
for(j=0;j<3;j++) cin>>start[i][j];
cout<<"\nEnter Final state(9 for empty tile):\n"; for(i=0;i<3;i++)
for(j=0;j<3;j++) cin>>final[i][j];
hi=heurestic(start); hf=heurestic(final);
7
cout<<"Strating h:"<<hi; display(start);
for(i=0;i<3;i++) {
for(j=0;j<3;j++) {
next[i][j]=start[i][j]; }
} while(hi>hf) {
for(i=0;i<3;i++) { for(j=0;j<3;j++) {
if(next[i][j]==9) {
posi=i; posj=j;
} } }
if(posi-1>=0 && upflags==0) {
next[posi][posj]=next[posi-1][posj]; next[posi-1][posj]=9; upflags=1;dwnflagp=1;
} else if(posi+1<=2 && dwnflags==0) {
next[posi][posj]=next[posi+1][posj]; next[posi+1][posj]=9; dwnflags=1;upflagp=1;
} else if(posj-1>=0 && lftflags==0) {
next[posi][posj]=next[posi][posj-1]; next[posi][posj-1]=9; lftflags=1;rtflagt=1;
} else if(posj+1<=2 && rtflags==0) {
next[posi][posj]=next[posi][posj+1]; next[posi][posj+1]=9;
8
rtflags=1;lftflagp=1; } else {
cout<<"\nThe search cannot reach to the destination";break;
}
//Calculate the heuristic of next state hn=heurestic(next);if(hn>=hi) {
//Next Heuristic for(i=0;i<3;i++){
for(j=0;j<3;j++) {
next[i][j]=start[i][j]; }
}rtflagt=0;lftflagp=0;upflagp=0;dwnflagp=0;
} else { hi=hn;
lftflags=lftflagp;rtflags=rtflagt;upflags=upflagp;dwnflags=dwnflagp;rtflagt=0;lftflagp=0;upflagp=0;dwnflagp=0;cout<<"\n\n"<<"heurestic="<<heurestic(next);display(next);if(hn==0)
cout<<"\n\nSUCCESS";for(i=0;i<3;i++){
for(j=0;j<3;j++) {
start[i][j]=next[i][j]; }
}
}
}
getch();
9
return 0;}
Program 5: Steepest Ascent Hill Climbing/******************************Name: Atishay Jain*Course: BE Final Year*Group: 4CO5*Subject: Artificial Intelligence*Prog: Steepest Ascent Hill Climbing for 8 Puzzle Problem*****************************/
#include<iostream>#include<conio.h>#include<cmath>using namespace std;
int start[3][3],final[3][3];
//Finds the position of the tile no tint findpos(int a[][3],int t){ for(int i=0;i<3;i++) {
for(int j=0;j<3;j++) {
if(a[i][j]==t) return (3*i+j+1);
} }
}
//Calculation of Heuristic: Distance from final stateint heurestic(int a[][3]){ int h=0,posi,posg; for(int i=1;i<=9;i++) {
posi=findpos(a,i); posg=findpos(final,i); h+=abs((float)posg-posi);
} return h;
}
//Matrix Displayvoid display(int a[][3]){
for(int i=0;i<3;i++){
cout<<"\n";
10
for(int j=0;j<3;j++){
if(a[i][j] !=9 )cout<<a[i][j]<<"\t";else cout<<" \t";
}}
}
int main(){ int next[3][3]; int i ,j,hi,hf,hn, posi,posj,lftflags=0,rtflags=0, upflags=0, dwnflags=0,lftflagp=0,rtflagp=0, upflagp=0,dwnflagp=0; cout<<"\nEnter starting state(Enter 9 for blank):\n"; for(i=0;i<3;i++)
for(j=0;j<3;j++) cin>>start[i][j];
cout<<"\nEnter Final state(9 for empty tile):\n"; for(i=0;i<3;i++)
for(j=0;j<3;j++) cin>>final[i][j];
hi=heurestic(start); hf=heurestic(final); cout<<"Strating h:"<<hi; display(start);
for(i=0;i<3;i++) {
for(j=0;j<3;j++) {
next[i][j]=start[i][j]; }
} while(hi>hf) {
for(i=0;i<3;i++) { for(j=0;j<3;j++) {
if(next[i][j]==9) {
posi=i; posj=j;
} } }
cout<<"\nOptions:\n"; int h1=999,h2=999,h3=999,h4=999;
if(posi-1>=0 && upflags==0) {
next[posi][posj]=next[posi-1][posj]; next[posi-1][posj]=9;
11
h1=heurestic(next); cout<<"\nHeurestic:"<<h1<<endl; display(next); next[posi-1][posj]=next[posi][posj]; next[posi][posj]=9;
} if(posi+1<=2 && dwnflags==0) {
next[posi][posj]=next[posi+1][posj]; next[posi+1][posj]=9; h2=heurestic(next); cout<<"\nHeurestic:"<<h2<<endl;
display(next); next[posi+1][posj]=next[posi][posj]; next[posi][posj]=9;
} if(posj-1>=0 && lftflags==0) {
next[posi][posj]=next[posi][posj-1]; next[posi][posj-1]=9; h3=heurestic(next); cout<<"\nHeurestic:"<<h3<<endl;
display(next); next[posi][posj-1]=next[posi][posj]; next[posi][posj]=9;
} if(posj+1<=2 && rtflags==0) {
next[posi][posj]=next[posi][posj+1]; next[posi][posj+1]=9;
h4=heurestic(next); cout<<"\nHeurestic:"<<h4<<endl;
display(next); next[posi][posj+1]=next[posi][posj]; next[posi][posj]=9;
} if(h1<=h2 && h1<=h3 && h1<=h4) {
next[posi][posj]=next[posi-1][posj]; next[posi-1][posj]=9;
upflags=1;dwnflagp=1; } else if(h2<=h1 && h2<=h3 && h2<=h4)
{ next[posi][posj]=next[posi+1][posj];
next[posi+1][posj]=9; dwnflags=1;upflagp=1; }
12
else if(h3<=h1 && h3<=h2 && h3<=h4) {
next[posi][posj]=next[posi][posj-1]; next[posi][posj-1]=9; lftflags=1;rtflagp=1;
} else if(h4<=h1 && h4<=h2 && h4<=h3)
{ next[posi][posj]=next[posi][posj+1];
next[posi][posj+1]=9; rtflags=1;lftflagp=1;
}
//Calculate the heuristic of next state hn=heurestic(next);if(hn>hi) {
cout<<"\nThe search cannot reach to the destination";break;
} else { hi=hn;
lftflags=lftflagp;rtflags=rtflagp;upflags=upflagp;dwnflags=dwnflagp;rtflagp=0;lftflagp=0;upflagp=0;dwnflagp=0;cout<<"\nChosen:";cout<<"\nHeurestic="<<heurestic(next);display(next);if(hn==0)
cout<<"\n\nSUCCESS";for(i=0;i<3;i++){
for(j=0;j<3;j++) {
start[i][j]=next[i][j]; }
}
}
}
getch();return 0;}
13
Program 6: Best First Search
/******************************Name: Atishay Jain*Course: BE Final Year*Group: 4CO5*Subject: Artificial Intelligence*Prog: Best First Search of r8 Puzzle Problem*****************************/
#include<iostream.h>#include<conio.h>#include<math.h>#include<process.h>struct node{
int arr[3][3];int h;int flag,r,l,u,d;
}*ptr=NULL,*prevptr=NULL;node *a[50];static int k=0;//Using specific Case for testing purposes…int initial[3][3]={2,8,3,1,6,4,7,9,5},final[3][3]={1,2,3,8,9,4,7,6,5};
int findpos(int arr[][3],int n){ for(int i=0;i<3;i++) {
for(int j=0;j<3;j++) {
if(arr[i][j]==n) return (3*i+j+1);
} } return 1;
}int heurestic(int arr[][3]){ int h=0,posi,posg; for(int i=1;i<=9;i++) {
posi=findpos(arr,i); posg=findpos(final,i); h+=abs(posg-posi);
} return h;
}void display(int arr[][3]){
for(int i=0;i<3;i++)
14
{cout<<"\n";for(int j=0;j<3;j++){
cout<<arr[i][j]<<"\t";}
}}void insert(node *n){
int t;if(k==0){
a[k]=n;k++;
}else{
t=n->h;int j;for(j=k;j>=0 && a[j]->h>t;j--){
a[j+1]=a[j];}a[j+1]=n;k++;
}}int main(){ int next[3][3],temp[3][3]; int i,j,hi,hg,hn,posi,posj; cout<<"\nEnter start state(enter 9 for blank):"; for(i=0;i<3;i++)
for(j=0;j<3;j++) cin>>initial[i][j];
cout<<"\nEnter goal state(enter 9 for blank):"; for(i=0;i<3;i++)
for(j=0;j<3;j++) cin>>final[i][j];
ptr=new node; for(i=0;i<3;i++)
for(j=0;j<3;j++)ptr->arr[i][j]=initial[i][j];
ptr->h=heurestic(ptr->arr); ptr->flag=0; ptr->l=0; ptr->r=0; ptr->u=0; ptr->d=0;
hi=heurestic(initial); hg=heurestic(final); cout<<"Heurestic"<<hi<<"\t";
15
display(initial); for(i=0;i<3;i++)
for(j=0;j<3;j++)next[i][j]=initial[i][j];
prevptr=ptr;
while(hi>hg) {
cout<<"\nSelected:"<<prevptr->h;for(i=0;i<3;i++){
for(j=0;j<3;j++){
next[i][j]=prevptr->arr[i][j];temp[i][j]=next[i][j];
}}for(i=0;i<3;i++){
for(j=0;j<3;j++){
if(next[i][j]==9){
posi=i;posj=j;
}}
}
if(posi-1>=0 && prevptr->u==0){
temp[posi][posj]=next[posi-1][posj];temp[posi-1][posj]=9;ptr=new node;for(i=0;i<3;i++)
for(j=0;j<3;j++)ptr->arr[i][j]=temp[i][j];
ptr->h=heurestic(ptr->arr);ptr->flag=0;ptr->d=1;ptr->u=0;ptr->l=0;ptr->r=0;
insert(ptr);for(i=0;i<3;i++)
for(j=0;j<3;j++)temp[i][j]=next[i][j];
}if(posi+1<=2 && prevptr->d==0){
temp[posi][posj]=next[posi+1][posj];temp[posi+1][posj]=9;ptr=new node;for(i=0;i<3;i++)
for(j=0;j<3;j++)
16
ptr->arr[i][j]=temp[i][j];ptr->h=heurestic(ptr->arr);ptr->flag=0;ptr->u=1;ptr->d=0;ptr->l=0;ptr->r=0;insert(ptr);for(i=0;i<3;i++)
for(j=0;j<3;j++)temp[i][j]=next[i][j];
}if(posj-1>=0 && prevptr->l==0){
temp[posi][posj]=next[posi][posj-1];temp[posi][posj-1]=9;ptr=new node;for(i=0;i<3;i++)
for(j=0;j<3;j++)ptr->arr[i][j]=temp[i][j];
ptr->h=heurestic(ptr->arr);ptr->flag=0;ptr->r=1;ptr->l=0;ptr->u=0;ptr->d=0;insert(ptr);for(i=0;i<3;i++)
for(j=0;j<3;j++)temp[i][j]=next[i][j];
}if(posj+1<=2 && prevptr->r==0){
temp[posi][posj]=next[posi][posj+1];temp[posi][posj+1]=9;ptr=new node;for(i=0;i<3;i++)
for(j=0;j<3;j++)ptr->arr[i][j]=temp[i][j];
ptr->h=heurestic(ptr->arr);ptr->flag=0;ptr->l=1;ptr->r=0;ptr->u=0;ptr->d=0;insert(ptr);for(i=0;i<3;i++)
for(j=0;j<3;j++)temp[i][j]=next[i][j];
}for(i=0;i<k;i++){
//cout<<a[i]->h;if(a[i]->flag==0)
17
{ptr=a[i];a[i]->flag=1;break;
}}hn=heurestic(ptr->arr);cout<<"\nHeurestic="<<hn;hi=hn;display(ptr->arr);cout<<"selected:"<<ptr->h;prevptr=ptr;if(hn==hg)
cout<<"SUCCESS"; } getch(); return 0;}
Program 7: Tower of Hanoi
/******************************Name: Atishay Jain*Course: BE Final Year*Group: 4CO5*Subject: Artificial Intelligence*Prog: Tower of Hanoi*****************************/
#include<stdio.h>#include<iostream>using namespace std;void move(char start,char end,char other,int n){
if(n==1){
cout<<"\nMove block no 1 from "<<start<<" to "<<end<<".";return;
}else{
move(start,other,end,n-1);cout<<"\nMove block no "<<n<<" from "<<start<<" to
"<<end<<".";move(other,end,start,n-1);
}
}int main(){
int n;cout<<"Enter the number blocks in stack A:";cin>>n;move('A','B','C',n);
}
18
