Example of Breadth Search
Here is a tree the root is 1. and the goals are 9,10,11,12 Queue = Q ----------------------------------------------------------------------- 1 2 ----------------------------------------------------------------------- At the first movement State = 1 ( is state is our goal :::::::: Not ) Sucessor of state is added in Queue form Back ( Q = 2 3 4 ) then state = queue[0] = 2 remove first item form queue. ( Q = 3 4 ) State = 2 ( is state is our goal :::::::: Not ) Sucessor of state is added in Queue form ( Q = 3 4 5 6 ) then state = queue[0] = 3 remove first item form queue. ( Q = 4 5 6 ) State = 3 ( is state is our goal :::::::: Not ) Sucessor of state is added in Queue form Front ( Q = 4 5 6 ) then state = queue[0] = 4 remove first item form queue. ( Q = 5 6 ) State = 4 ( is state is our goal :::::::: Not ) Sucessor of state is added in Queue form Front ( Q = 5 6 7 8 ) then state = queue[0] = 5 remove first item form ...