Programs in Computer Engineering

Wumpus World Problem Implementation > Java Program Artificial Intelligence Program: import java.util.*; class Environment {

To implement local search algorithm for Travelling Salesman Problem using Hill Climb > Java Program Artificial Intelligence Program: package javaapplication5; import java.util.*; public class JavaApplication5 {

To perform adversarial search using Min Max search > Java Program Artificial Intelligence Program: import java.util.Scanner; public class MinMax {     public static void main(String[] args) {         new MinMax().go();         System.out.println("\n");     }

To apply informed search algorithm to solve 8 puzzle problem (A* search)  > Java Program Artificial Intelligence Program: class Astar {

Solution for Water Jug Problem with 2 Jugs > Java Program Artificial Intelligence Program: public class Jug {     static int flag=0;    public static void main(String[] args) {       state(0,0);        System.out.println("EXIT");     }    

To perform uninformed search using DFS Traversal > Python Program Artificial Intelligence Program: graph={'A':['B','C'],'B':['A','D','E'],'C':['A','E'],'D':['B','E'],'E':['D','B','C']}

To perform uninformed search using  BFS Traversal > Python Program Artificial Intelligence Program: graph={'A':['B','C'],'B':['A','D','E'],'C':['A','E'],'D':['B','E'],'E':['D','B','C']}

To solve Tower of Hanoi > Python Program Artificial Intelligence Program: #function of tower of hanoi