diff --git a/units/en/unit1/additional-readings.mdx b/units/en/unit1/additional-readings.mdx
index b881244..d1f1820 100644
--- a/units/en/unit1/additional-readings.mdx
+++ b/units/en/unit1/additional-readings.mdx
@@ -11,3 +11,4 @@ These are **optional readings** if you want to go deeper.
## Gym [[gym]]
- [Getting Started With OpenAI Gym: The Basic Building Blocks](https://blog.paperspace.com/getting-started-with-openai-gym/)
+- [Make your own Gym custom environment](https://www.gymlibrary.dev/content/environment_creation/)
diff --git a/units/en/unit1/hands-on.mdx b/units/en/unit1/hands-on.mdx
index 419aefd..d3645de 100644
--- a/units/en/unit1/hands-on.mdx
+++ b/units/en/unit1/hands-on.mdx
@@ -34,6 +34,7 @@ You can either do this hands-on by reading the notebook or following it with the
+
# Unit 1: Train your first Deep Reinforcement Learning Agent 🤖
@@ -42,9 +43,6 @@ In this notebook, you'll train your **first Deep Reinforcement Learning agent**
⬇️ Here is an example of what **you will achieve in just a couple of minutes.** ⬇️
-
-
-
```python
%%html
@@ -71,7 +69,7 @@ At the end of the notebook, you will:
-## This notebook is from Deep Reinforcement Learning Course
+## This hands-on is from Deep Reinforcement Learning Course
In this free course, you will:
@@ -90,7 +88,7 @@ The best way to keep in touch and ask questions is to join our discord server to
## Prerequisites 🏗️
Before diving into the notebook, you need to:
-🔲 📝 **Done Unit 0** that gives you all the **information about the course and help you to onboard** 🤗
+🔲 📝 **Read Unit 0** that gives you all the **information about the course and help you to onboard** 🤗
🔲 📚 **Develop an understanding of the foundations of Reinforcement learning** (MC, TD, Rewards hypothesis...) by doing Unit 1
diff --git a/units/en/unit2/bellman-equation.mdx b/units/en/unit2/bellman-equation.mdx
index 6979d23..4c801ae 100644
--- a/units/en/unit2/bellman-equation.mdx
+++ b/units/en/unit2/bellman-equation.mdx
@@ -58,6 +58,6 @@ But you'll study an example with gamma = 0.99 in the Q-Learning section of this
-To recap, the idea of the Bellman equation is that instead of calculating each value as the sum of the expected return, **which is a long process.** This is equivalent **to the sum of immediate reward + the discounted value of the state that follows.**
+To recap, the idea of the Bellman equation is that instead of calculating each value as the sum of the expected return, **which is a long process**, we calculate the value as **the sum of immediate reward + the discounted value of the state that follows.**
Before going to the next section, think about the role of gamma in the Bellman equation. What happens if the value of gamma is very low (e.g. 0.1 or even 0)? What happens if the value is 1? What happens if the value is very high, such as a million?
diff --git a/units/en/unit2/mc-vs-td.mdx b/units/en/unit2/mc-vs-td.mdx
index 1d3517f..bac1639 100644
--- a/units/en/unit2/mc-vs-td.mdx
+++ b/units/en/unit2/mc-vs-td.mdx
@@ -76,8 +76,7 @@ For instance, if we train a state-value function using Monte Carlo:
## Temporal Difference Learning: learning at each step [[td-learning]]
-- **Temporal Difference, on the other hand, waits for only one interaction (one step) \\(S_{t+1}\\)**
-- to form a TD target and update \\(V(S_t)\\) using \\(R_{t+1}\\) and \\( \gamma * V(S_{t+1})\\).
+**Temporal Difference, on the other hand, waits for only one interaction (one step) \\(S_{t+1}\\)** to form a TD target and update \\(V(S_t)\\) using \\(R_{t+1}\\) and \\( \gamma * V(S_{t+1})\\).
The idea with **TD is to update the \\(V(S_t)\\) at each step.**
diff --git a/units/en/unit2/two-types-value-based-methods.mdx b/units/en/unit2/two-types-value-based-methods.mdx
index 3422e7d..df83311 100644
--- a/units/en/unit2/two-types-value-based-methods.mdx
+++ b/units/en/unit2/two-types-value-based-methods.mdx
@@ -36,7 +36,7 @@ Consequently, whatever method you use to solve your problem, **you will have a
So the difference is:
- In policy-based, **the optimal policy (denoted π\*) is found by training the policy directly.**
-- In value-based, **finding an optimal value function (denoted Q\* or V\*, we'll study the difference after) in our leads to having an optimal policy.**
+- In value-based, **finding an optimal value function (denoted Q\* or V\*, we'll study the difference after) leads to having an optimal policy.**
@@ -42,9 +43,6 @@ In this notebook, you'll train your **first Deep Reinforcement Learning agent**
⬇️ Here is an example of what **you will achieve in just a couple of minutes.** ⬇️
-
-
-
```python
%%html
@@ -71,7 +69,7 @@ At the end of the notebook, you will:
-## This notebook is from Deep Reinforcement Learning Course
+## This hands-on is from Deep Reinforcement Learning Course
In this free course, you will:
@@ -90,7 +88,7 @@ The best way to keep in touch and ask questions is to join our discord server to
## Prerequisites 🏗️
Before diving into the notebook, you need to:
-🔲 📝 **Done Unit 0** that gives you all the **information about the course and help you to onboard** 🤗
+🔲 📝 **Read Unit 0** that gives you all the **information about the course and help you to onboard** 🤗
🔲 📚 **Develop an understanding of the foundations of Reinforcement learning** (MC, TD, Rewards hypothesis...) by doing Unit 1
diff --git a/units/en/unit2/bellman-equation.mdx b/units/en/unit2/bellman-equation.mdx
index 6979d23..4c801ae 100644
--- a/units/en/unit2/bellman-equation.mdx
+++ b/units/en/unit2/bellman-equation.mdx
@@ -58,6 +58,6 @@ But you'll study an example with gamma = 0.99 in the Q-Learning section of this
-To recap, the idea of the Bellman equation is that instead of calculating each value as the sum of the expected return, **which is a long process.** This is equivalent **to the sum of immediate reward + the discounted value of the state that follows.**
+To recap, the idea of the Bellman equation is that instead of calculating each value as the sum of the expected return, **which is a long process**, we calculate the value as **the sum of immediate reward + the discounted value of the state that follows.**
Before going to the next section, think about the role of gamma in the Bellman equation. What happens if the value of gamma is very low (e.g. 0.1 or even 0)? What happens if the value is 1? What happens if the value is very high, such as a million?
diff --git a/units/en/unit2/mc-vs-td.mdx b/units/en/unit2/mc-vs-td.mdx
index 1d3517f..bac1639 100644
--- a/units/en/unit2/mc-vs-td.mdx
+++ b/units/en/unit2/mc-vs-td.mdx
@@ -76,8 +76,7 @@ For instance, if we train a state-value function using Monte Carlo:
## Temporal Difference Learning: learning at each step [[td-learning]]
-- **Temporal Difference, on the other hand, waits for only one interaction (one step) \\(S_{t+1}\\)**
-- to form a TD target and update \\(V(S_t)\\) using \\(R_{t+1}\\) and \\( \gamma * V(S_{t+1})\\).
+**Temporal Difference, on the other hand, waits for only one interaction (one step) \\(S_{t+1}\\)** to form a TD target and update \\(V(S_t)\\) using \\(R_{t+1}\\) and \\( \gamma * V(S_{t+1})\\).
The idea with **TD is to update the \\(V(S_t)\\) at each step.**
diff --git a/units/en/unit2/two-types-value-based-methods.mdx b/units/en/unit2/two-types-value-based-methods.mdx
index 3422e7d..df83311 100644
--- a/units/en/unit2/two-types-value-based-methods.mdx
+++ b/units/en/unit2/two-types-value-based-methods.mdx
@@ -36,7 +36,7 @@ Consequently, whatever method you use to solve your problem, **you will have a
So the difference is:
- In policy-based, **the optimal policy (denoted π\*) is found by training the policy directly.**
-- In value-based, **finding an optimal value function (denoted Q\* or V\*, we'll study the difference after) in our leads to having an optimal policy.**
+- In value-based, **finding an optimal value function (denoted Q\* or V\*, we'll study the difference after) leads to having an optimal policy.**
