Best First Search: Graphs

package graphs; import java.util.*; import graphs.State; public class GraphImplementation { public void dfs(Node root) { //Avoid infinite loops if(root == null) return; System.out.print(root.getVertex() + “t”); root.state = State.Visited; //for every child for(Node n: root.getChild()) { //if childs state is not visited then recurse if(n.state == State.Unvisited) { dfs(n); } } } public void bfs(Node root) …

Asignación 7: Cilog

A. tell brothers(X,Y) <- brother(X,Y). tell brothers(X,Y) <- sister(X,Y). tell sister(nathalia,nieves). tell brother(carlos,beltran). tell parent(X,Y) <- father(X,Y). tell parent(X,Y) <- mother(X,Y). tell brothers(Q,W) <- parent(X,Q) & parent(X,W). tell father(walt,carlos). tell father(walt,nathalia). tell mother(ana,carlos). tell mother(ana,nathalia). ask brothers(nathalia,nieves).   tell male(X). tell female(X). ask female(nathalia). B. tell pinta(X) <- ~fotografos (X). tell escultores(X) <- ~fotografos(X). tell …

Asignación #3: A* program

import java.util.PriorityQueue; import java.util.HashSet; import java.util.Set; import java.util.List; import java.util.Comparator; import java.util.ArrayList; import java.util.Collections; public class AstarSearchAlgo{ //h scores is the stright-line distance from the current city to Bucharest public static void main(String[] args){ //initialize the graph base on the Romania map Node n1 = new Node(“Arad”,366); Node n2 = new Node(“Zerind”,374); Node n3 = …

Are these really AI machines?

http://www.cs.umb.edu/~ding/history/470_670_fall_2013/homework/hwk1_AI_Applications.html The website above provides a list of supposedly AI machines. I’ll talk about one of them and this one is called Cleverbot. Alvin Mai’s Cleverbot is a chatterbot that’s modeled after human behavior and able to hold a conversation. It does so by remembering words from conversations. The responses are not programmed. Instead, it finds keywords …