CS代考程序代写 10/21/2019 CSCI 561 (139 unread)

10/21/2019 CSCI 561 (139 unread)
question
344 views
How deep does the reference agent search?
In the hw2 description, it is said that our agent will play against “a simple minimax agent with no alpha-beta pruning”. But how simple is the agent? We know nothing about the agent except it uses minimax without alpha-beta pruning.
Updated 12 days ago by Anonymous
the students’ answer, where students collectively construct a single answer
Someone correct me if I’m wrong but my understanding is same time limits apply. The conditions are the same for our agent and adversary agent. We can learn how long it takes to grow a search tree on the computer as function of number of layers so we can infer how far the other agent can possibly go.
~ An instructor (Daniel Link) endorsed this answer ~
Updated 12 days ago by Pedram Safi
followup discussions for lingering questions and comments
Resolved
Unresolved
Anonymous 12 days ago
I think so. Without more information, it is difficult to decide which strategy to use.
Daniel Link 12 days ago See student¡¯s answer above.
Resolved
Unresolved
Anonymous 12 days ago
Good question. Hope some TA could answer that.
If every piece has 8 moves to consider, there are 8*19=152 moves for one state.
With such a large branching factor, I don’t think our agent can reach a depth deeper than 3.
Pedram Safi 12 days ago it all depends on how much time you have left. That is given to us as input. Daniel Link 12 days ago Pedram is right.
https://piazza.com/class/jzob0qt1owq15p?cid=341
1/2
2wh

10/21/2019 CSCI 561 (139 unread)
https://piazza.com/class/jzob0qt1owq15p?cid=341
2/2