Not logged in. · Lost password · Register

 uv26ukas Member for 3 months 3 posts 2019-11-23, 14:37   #1   Subject: Problem 4.1 How to draw the complete game tree ? I can't understand drawing rules. Can somebody show a simple example?
 johanno Member since Mar 2017 19 posts 2019-11-24, 09:58   #2   I've understood it like this:           (3,2) -> (1,3)              |              v           (4,2)
 Member since Oct 2019 86 posts 2019-11-24, 10:23   #3   Problem 4.1. asks you to draw a tree of choices the players have. The initial state, A _ _ B -------- 1 2 3 4can be represented as a tuple (1,4). It is A's turn, and they need to move. The only option is to move to square 2, resulting in the state (2,4). Similarly, B needs to move to 3: (2,3). Now A has the option to move back, (1,3), or to jump over B, (4,3). The tree so far would look like this:    (1,4)      |    (2,4)      |    (2,3)   /     \ (1,3) (4,3) Some of the states will get repeated - you are not expected to expand those again. Subproblem (2) asks you to come up with an idea for how the agent could deal with such states.
Close Smaller – Larger + Reply to this post:
Verification code: Please enter the word from the image into the text field below. (Type the letters only, lower case is okay.)
Smileys:
Special characters:
Go to forum
Datenschutz | Kontakt