You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I am not really familiar with the code in this Github repository, in particular, with the code that generates the rooms. However, I was told that the optimal policy for each room can be generated from the "reverse playing" algorithm that is used to ensure that the rooms are solvable. So, is this true? If yes, what's the easiest way to do it? (Of course, if I get familiar with the code, I will be able to answer this question, but if you can immediately answer it, that would save me some time: I am looking for some environments where the optimal policy is known, so I was wondering if I could use your code to compute the optimal policy).
The text was updated successfully, but these errors were encountered:
I am not really familiar with the code in this Github repository, in particular, with the code that generates the rooms. However, I was told that the optimal policy for each room can be generated from the "reverse playing" algorithm that is used to ensure that the rooms are solvable. So, is this true? If yes, what's the easiest way to do it? (Of course, if I get familiar with the code, I will be able to answer this question, but if you can immediately answer it, that would save me some time: I am looking for some environments where the optimal policy is known, so I was wondering if I could use your code to compute the optimal policy).
The text was updated successfully, but these errors were encountered: