(续上题) Select the boxes for leaf values that don't get visited due to pruning
A.5
B.6
C.2
D.1
- · 有3位网友选择 C,占比37.5%
- · 有2位网友选择 B,占比25%
- · 有2位网友选择 D,占比25%
- · 有1位网友选择 A,占比12.5%
A.5
B.6
C.2
D.1
【简答题】Do these passages contain arguments? If so, what are their conclusions? 1. Cutting the interest rate will have no effect on the stock market this time round as people have been expecting a rate cut all along. This factor has already been reflected in the market. Yes. The conclusion is that this time, cutting interest rate will have no effect on the stock market. So it is raining heavily and this building might collapse. But I don't really care. 2. Although the first statement starts with “so” it does not indicate a conclusion. Virgin would then dominate the rail system. Is that something the government should worry about? Not necessarily. The industry is regulated, and one powerful company might at least offer a more coherent schedule of services than the present arrangement has produced. The reason the industry was broken up into more than 100 companies at privatisation was not operational, but political: the Conservative government thought it would thus be harder to renationalise. 3. All of Russia’s problems of human rights and democracy come back to three things: the legislature, the executive and the judiciary. None works as well as it should. Parliament passes laws in a hurry, and has neither the ability nor the will to call high officials to account. State officials abuse human rights (either on their own, or on orders from on high) and work with remarkable slowness and disorganisation. The courts almost completely fail in their role as the ultimate safeguard of freedom and order. 4. Most mornings, Park Chang Woo arrives at a train station in central Seoul, South Korea's capital. But he is not commuter. He is unemployed and goes there to kill time. Around him, dozens of jobless people pass their days drinking soju, a local version of vodka. For the moment, middleaged Mr Park would rather read a newspaper. He used to be a brick layer for a small construction company in Pusan, a southern port city. But three years ago the country's financial crisis cost him that job, so he came to Seoul, leaving his wife and two children behind. Still looking for work, he has little hope of going home any time soon. 5. For a long time, astronomers suspected that Europa, one of Jupiter's many moons, might harbour a watery ocean beneath its ice-covered surface. They were right. Now the technique used earlier this year to demonstrate the existence of the Europan ocean has been employed to detect an ocean on another Jovian satellite, Ganymede, according to work announced at the recent American Geo-physical Union meeting in San Francisco. 6. There are no hard numbers, but the evidence from Asia’s expatriate community is unequivocal. Three years after its handover from Britain to China, Hong Kong is unlearning English. The city's gweilos (Cantonese for “ghost men”) must go to ever greater lengths to catch the oldest taxi driver available to maximize their chances of comprehension. Hotel managers are complaining that they can no longer find enough English- speakers to act as receptionists. Departing tourists, polled at the airport, voice growing frustration at not being understood.
A、Zhuyu is a kind of herb.
B、People usually hang Zhuyu on the door.
C、Zhuyu could eliminate diseases and subjugate disasters.
D、People like wearing Zhuyu on usual days.
A、clarify
B、classify
C、inspire
D、disseminate
Q13 Lookahead Graph Search Recall from lecture the general algorithm for Graph Search reproduced below.Using GRAPH-SEARCH, when a node is expanded it is added to the closed set. This means that even if a node is added to the fringe multiple times it will not be expanded more than once. Consider an alternative version of GRAPH-SEARCH, LOOKAHEAD-GRAPH-SEARCH, which saves memory by using a "fringe-closed-set" keeping track of which states have been on the fringe and only adding a child node to the fringe if the state of that child node has not been added to it at some point. Concretely, we replace the highlighted block above with the highlighted block below.Now, we've produced a more memory efficient graph search algorithm. However, in doing so, we might have affected some properties of the algorithm. To explore the possible differences, consider the example graph below.Q13.1 If using LOOKAHEAD-GRAPH-SEARCH with an A* node expansion strategy, which path will this algorithm return? (We strongly encourage you to step through the execution of the algorithm on a scratch sheet of paper and keep track of the fringe and the search tree as nodes get added to the fringe.)
A、S→A→D→G
B、S→B→G
C、S→A→C→G
D、S→B→D→G
Q4 Alpha-Beta Pruning Consider the game tree shown below. Triangles that point up, such as at the top node (root), represent choices for the maximizing player; triangles that point down represent choices for the minimizing player. Assuming both players act optimally, use alpha-beta pruning to find the value of the root node. The search goes from left to right; when choosing which child to visit first, choose the left-most unvisited child. In the first set of boxes below, enter the values of the labeled nodes. Then, select the leaf nodes that don't get visited due to pruning. Hint: Note that the value of a node where pruning occurs is not necessarily the maximum or minimum (depending on which node) of its children. When you prune on conditions V>βV>βV>β or V<αv<αv<α, assume that the value of node is vvv. src="http://static.jiandati.com/d80de79-chaoxing2016-857389.png"> Enter the values of the labeled nodes A:
Q1 Minimax Consider the zero-sum game tree shown below. Triangles that point up, such as at the top node (root), represent choices for the maximizing player; triangles that point down represent choices for the minimizing player. Outcome values for the maximizing player are listed for each leaf node, represented by the values in squares at the bottom of the tree. Assuming both players act optimally, carry out the minimax search algorithm. Enter the values for the letter nodes in the boxes below the tree.Input Answers Here A:
A、Start, A, B, C, D, Goal
B、Start, A, C, Goal
C、Start, B, A, D, C, Goal
D、Start, A, D, Goal
Q2 Expectiminimax Consider the game tree shown below. As in the previous problem, triangles that point up, such as the top node (root), represent choices for the maximizing player; triangles that point down represent choices for the minimizing player. The circular nodes represent chance nodes in which each of the possible actions may be taken with equal probability. The square nodes at the bottom represent leaf nodes. Assuming both players act optimally, carry out the expectiminimax search algorithm. Enter the values for the letter nodes in the boxes below the tree.Input Answers Here A:
为了保护您的账号安全,请在“简答题”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!