Scribd
Upload
105 views2 pages

Computational Intelligence - Assignment 1

This document contains 7 computational intelligence assignment questions about search problems, search strategies, and graph traversal algorithms. It asks the student to define a search problem in terms of states, operators, goals, and costs; analyze Breadth-First Search and Depth-First Search on a sample search tree; compare DFS and BFS on a given search problem; discuss forward and backward reasoning for chess and Rubik's cube; choose a graph traversal for a maze problem; show the order of node visits for various search algorithms on sample trees; and analyze portions of a sample state space and node visit orders for various search strategies.

Uploaded by

jaijohnk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
105 views2 pages

Computational Intelligence - Assignment 1

This document contains 7 computational intelligence assignment questions about search problems, search strategies, and graph traversal algorithms. It asks the student to define a search problem in terms of states, operators, goals, and costs; analyze Breadth-First Search and Depth-First Search on a sample search tree; compare DFS and BFS on a given search problem; discuss forward and backward reasoning for chess and Rubik's cube; choose a graph traversal for a maze problem; show the order of node visits for various search algorithms on sample trees; and analyze portions of a sample state space and node visit orders for various search strategies.

Uploaded by

jaijohnk
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

COMPUTATIONAL INTELLIGENCE ASSIGNMENT 1

1. Given the following 8-puzzle, define the problem as a search problem in terms of states, operators,
a goal test and a path cost.

2. For the search tree below, show at each step what nodes are in the queue for both the Breath-FirstSearch and Depth-First-Search. Show the list of nodes that are expanded.

Describe the terms complete and optimal with regards to evaluating search strategies. Are either
Breath-First-Search or Depth-First-Search complete? Is either of them optimal?
3. Consider the search problem represented in Figure, where a is the start node and f is the goal node.
Would you prefer DFS or BFS for this problem? Why? Which sequences of paths are explored by
BFS and DFS in this problem?

4. What reasoning direction is a more suitable heuristic in the game of Chess forward or backward?
What about the Rubiks cube puzzle? Justify your answers by referring to properties of the search
space in each case.
5. You find yourself in a maze, looking for the exit: which graph traversal would you choose, depthfirst or breadth-first? why?
6. For the following tree, show the order of nodes visited for breadth-first search, depth-first search,
uniform cost search, and iterative deepening search . The goal node is I and the numbers next to the
edges indicate the associated cost.

7. Consider a state space where the start state is number 1 and the successor function for state n

returns two states, numbers 2n and 2n+1.


a. Draw the portion of the state space for states 1 to 15.
b. Suppose the goal state is 11. List the order in which nodes will be visited for breadthfirst search, depth-limited search with limit 3, and iterative deepening search.

You might also like