This assignment looks at Graphs and Network concepts, including Petri Nets: Q2 (3 points): Given the graph above, and a stack structure, show the behavior of a depth first search (use the table format below and add new rows until the target is found): Note that new items on the stack will go to the end of the list (i.e., for the list [0,1,2] the last in the stack is 2: Node to process (id or number) Stack contents (last in first out) Notes empty empty or [] Startnode = ? Q3 (3 points): Given the graph above, and a queue structure, show the behavior of a breadth first search (use the table format below and add new rows until the target is found): Note that new items on the queue will go to the end of the list (i.e., for the list [0,1,2] the last in the queue is 2: Node to process (id or number) Queue contents (first in first out) Notes empty empty or [] Startnode= ? Q4 (2 points): In your own words, compare the effectiveness of search solutions (like Minimax) to gameplay (like Chess) versus intuition or pattern recognition approaches to solutions in the same game. When is one more effective than the other? Note: You can consider the Kasparov versus Deep Blue match, or the AlphaGo versus Lee Sedol match, or compare Deep Blue versus Alpha Go. Readings: https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/ Petri-nets and reachability: Q5 (3pts): Given the Petri net below, draw the corresponding reachability graph. Comment on how this relates to a finite state machine. a3-petri-net.png
