_|8kf+RCiEMHiT(1PvbFD6Jdj-HF9j^?Lt|~G;lP}naU93j#~Z$^Jzpe
z!|#15^jMs+THAW`3C^z=G(sr+9V}*27Qni?O4-iJVTqGVes4maFYkwvoITraUfyCn
z0ntQra&x25=e6Ek5qNY!yK^In!P6TG5stu7L@ccfwB&hxE>SH1Jaia>eHzV4a(u=<
z&s8`}qkQ=ul0|K#b`Z$;FTccYe^}P;$I5W`8M6%B9BgYcGnqfx<_nLfZu&qGiu`qq
zo&j%LS)Pw)+_1q1E_cgBx7zb+(>;!ZEt0t(%LYNZfm1!9?BW^%lJqAE;L;Z(JE~q4
znoWk6LEkR_;!yXKoYqeeA~7L6CrV}C8(s~5%h}-)hW{{ tag }}
- {% for post in posts %}
- {% include archive-single.html %}
- {% endfor %}
-{% endfor %}
From 3adff6386bf9dd0d893c97628a26c14cf9067b2b Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 20:13:42 +0100
Subject: [PATCH 18/85] Update
2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
---
.../2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
index 3b6cc783d..e0c6fc959 100644
--- a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
+++ b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
@@ -26,7 +26,7 @@ n=100000
choix_joueur = np.random.randint(0,3,n)
bonne_porte = np.random.randint(0,3,n)
- ```
+```
We will stock the results of the expereience in 2 numpy arrays : garder / changer (Keep /Change).
If you decide to keep the first door you picked, you only win when your first choice is the same as the door randomly picked (seems obvious I know). On the contrary, if you decide to change your choice, picking the good door is the only way you can lose. To explain briefly, just imagine you picked one of the two wrong doors : the host reveals a goat behind one of the two doors left. Then final door is the one behind wich the car is hiding, and as you change the door you picked first you win it !
In terms of numpy arrays, this can be illustrated like following :
@@ -34,7 +34,7 @@ bonne_porte = np.random.randint(0,3,n)
garder = bonne_porte[bonne_porte == choix_joueur]
changer = bonne_porte[choix_joueur != bonne_porte]
```
- ### Results
+ ### Results
In order to get some intuituve results, I decided to give 1 point to a player everytime he wins the game and ploted the number of wins for each strategy, by playing 100,000 games first and then I compared the number of wins for each strategy depending on the number of games played.
From cb9e4731cc6a80ede76461ac8b64b2ff7cf299db Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 20:14:39 +0100
Subject: [PATCH 19/85] Update _config.yml
---
_config.yml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_config.yml b/_config.yml
index 64bfdbbac..978279a42 100644
--- a/_config.yml
+++ b/_config.yml
@@ -6,7 +6,7 @@
name: Tino Margely
# Short bio or description (displayed in the header)
-description: Aspiring Data Scientist from France lol
+description: Aspiring Data Scientist from France
#
From 19c602866b756d526a9a32baa546aa212e6a232d Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 20:16:40 +0100
Subject: [PATCH 20/85] Update _config.yml
---
_config.yml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_config.yml b/_config.yml
index 978279a42..9a2d0367f 100644
--- a/_config.yml
+++ b/_config.yml
@@ -6,7 +6,7 @@
name: Tino Margely
# Short bio or description (displayed in the header)
-description: Aspiring Data Scientist from France
+description: Aspiring Data Scientist from France.
#
From 8eefeb409bb90a9a2b15c4799b083fe6c493b989 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 21:43:46 +0100
Subject: [PATCH 21/85] Update
2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
---
...A-Numpy-Approach-To-The-Minty-Hall-Project.md | 16 ++++++----------
1 file changed, 6 insertions(+), 10 deletions(-)
diff --git a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
index e0c6fc959..139b1556e 100644
--- a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
+++ b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
@@ -8,15 +8,11 @@ This was my very first Data Science Project, wich is an exercise from the "OpenC
## My first Data Science Project
-----
-### The Monnty Hall Problem
-" The Monty Hall problem is a brain teaser, in the form of a probability puzzle, loosely based on the American television game show Let's Make a Deal and named after its original host, Monty Hall. The problem was originally posed (and solved) in a letter by Steve Selvin to the American Statistician in 1975 (Selvin 1975a), (Selvin 1975b). It became famous as a question from a reader's letter quoted in Marilyn vos Savant's "Ask Marilyn" column in Parade magazine in 1990 (vos Savant 1990a):
- Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia)
-
-### Model The problem with Numpy
-
+### The Monty Hall Problem
+> " The Monty Hall problem is a brain teaser, in the form of a probability puzzle, loosely based on the American television game show Let's Make a Deal and named after its original host, Monty Hall. The problem was originally posed (and solved) in a letter by Steve Selvin to the American Statistician in 1975 (Selvin 1975a), (Selvin 1975b). It became famous as a question from a reader's letter quoted in Marilyn vos Savant's "Ask Marilyn" column in Parade magazine in 1990 (vos Savant 1990a):
+> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia)
+ ### Model The problem with Numpy
To model this problem I first started by importing all the libraries needed and created two numpy arrays. We will give to each door a different number, from 0 to 2. The first array called choix_joueur (Player's choice) picks up a random number between 0 and 2 represents a randomly chosen door for the player. The second array called bonne_porte (Good door) represents the door hiding the car. We also introduce a variable "n" wich representing the number of games we want to simulate.
-```python
- ```
```python
import matplotlib.pyplot as plt
@@ -34,7 +30,7 @@ bonne_porte = np.random.randint(0,3,n)
garder = bonne_porte[bonne_porte == choix_joueur]
changer = bonne_porte[choix_joueur != bonne_porte]
```
- ### Results
+### Results
In order to get some intuituve results, I decided to give 1 point to a player everytime he wins the game and ploted the number of wins for each strategy, by playing 100,000 games first and then I compared the number of wins for each strategy depending on the number of games played.
@@ -61,7 +57,7 @@ ax2.set_title("Gain des joueurs en fonction du nombre de parties")
ax2.scatter(samples, [play_game(i)[0] for i in samples],c='r')
ax2.scatter(samples, [play_game(i)[1] for i in samples], c='g')
```
- #### And here are the results :
+#### And here are the results :
In the end, it is clear that the best strategy is to change the door from your first choice if you want to win the car !
From 846035d1da9c78ceb4f784ff71000aa7f37ef9f5 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 21:45:55 +0100
Subject: [PATCH 22/85] Update
2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
---
.../2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md | 5 +++--
1 file changed, 3 insertions(+), 2 deletions(-)
diff --git a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
index 139b1556e..4e772f176 100644
--- a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
+++ b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
@@ -10,8 +10,9 @@ This was my very first Data Science Project, wich is an exercise from the "OpenC
### The Monty Hall Problem
> " The Monty Hall problem is a brain teaser, in the form of a probability puzzle, loosely based on the American television game show Let's Make a Deal and named after its original host, Monty Hall. The problem was originally posed (and solved) in a letter by Steve Selvin to the American Statistician in 1975 (Selvin 1975a), (Selvin 1975b). It became famous as a question from a reader's letter quoted in Marilyn vos Savant's "Ask Marilyn" column in Parade magazine in 1990 (vos Savant 1990a):
-> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia)
- ### Model The problem with Numpy
+> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia)
+
+### Model The problem with Numpy
To model this problem I first started by importing all the libraries needed and created two numpy arrays. We will give to each door a different number, from 0 to 2. The first array called choix_joueur (Player's choice) picks up a random number between 0 and 2 represents a randomly chosen door for the player. The second array called bonne_porte (Good door) represents the door hiding the car. We also introduce a variable "n" wich representing the number of games we want to simulate.
```python
From 9f7f840462b252fbc63c726b5914e0a5509c5e39 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 21:52:25 +0100
Subject: [PATCH 23/85] Update _config.yml
---
_config.yml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_config.yml b/_config.yml
index 9a2d0367f..978279a42 100644
--- a/_config.yml
+++ b/_config.yml
@@ -6,7 +6,7 @@
name: Tino Margely
# Short bio or description (displayed in the header)
-description: Aspiring Data Scientist from France.
+description: Aspiring Data Scientist from France
#
From 68497bd5fee964c211ff1da2e2b44d0ed2f2df54 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 21:53:24 +0100
Subject: [PATCH 24/85] Update
2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
---
_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
index 4e772f176..2d04dc558 100644
--- a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
+++ b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
@@ -10,7 +10,7 @@ This was my very first Data Science Project, wich is an exercise from the "OpenC
### The Monty Hall Problem
> " The Monty Hall problem is a brain teaser, in the form of a probability puzzle, loosely based on the American television game show Let's Make a Deal and named after its original host, Monty Hall. The problem was originally posed (and solved) in a letter by Steve Selvin to the American Statistician in 1975 (Selvin 1975a), (Selvin 1975b). It became famous as a question from a reader's letter quoted in Marilyn vos Savant's "Ask Marilyn" column in Parade magazine in 1990 (vos Savant 1990a):
-> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia)
+> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia).
### Model The problem with Numpy
To model this problem I first started by importing all the libraries needed and created two numpy arrays. We will give to each door a different number, from 0 to 2. The first array called choix_joueur (Player's choice) picks up a random number between 0 and 2 represents a randomly chosen door for the player. The second array called bonne_porte (Good door) represents the door hiding the car. We also introduce a variable "n" wich representing the number of games we want to simulate.
From a1f42320a0cbec05aa50871c090bc82647f9213b Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:00:08 +0100
Subject: [PATCH 25/85] Update
2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
---
.../2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md | 3 ++-
1 file changed, 2 insertions(+), 1 deletion(-)
diff --git a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
index 2d04dc558..4bc2f9c1a 100644
--- a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
+++ b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
@@ -59,6 +59,7 @@ ax2.scatter(samples, [play_game(i)[0] for i in samples],c='r')
ax2.scatter(samples, [play_game(i)[1] for i in samples], c='g')
```
#### And here are the results :
-
+
+
In the end, it is clear that the best strategy is to change the door from your first choice if you want to win the car !
From f0a635eeb1606e06373d7ea4c4a6070f371145ee Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:01:02 +0100
Subject: [PATCH 26/85] Update _config.yml
---
_config.yml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_config.yml b/_config.yml
index 978279a42..5a8ea818e 100644
--- a/_config.yml
+++ b/_config.yml
@@ -20,7 +20,7 @@ footer-links:
facebook:
flickr:
github: TinoMargely
- instagram:
+ instagram:tinomargely
linkedin:
pinterest:
rss: # just type anything here for a working RSS icon
From e79e06c80558bc21e8acca8bf4a78c471fdab556 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:05:18 +0100
Subject: [PATCH 27/85] Update _config.yml
---
_config.yml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_config.yml b/_config.yml
index 5a8ea818e..cd116488c 100644
--- a/_config.yml
+++ b/_config.yml
@@ -6,7 +6,7 @@
name: Tino Margely
# Short bio or description (displayed in the header)
-description: Aspiring Data Scientist from France
+description: Aspiring Data Scientist from France.
#
From e8948518fd32789be4e135211abb16c4f8e307cc Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:13:27 +0100
Subject: [PATCH 28/85] Update
2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
---
...19-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md | 8 ++++----
1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
index 4bc2f9c1a..dd77b8024 100644
--- a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
+++ b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
@@ -1,18 +1,18 @@
---
layout: post
-title: A Numpy Approach of the Monty Hall Problem
+title: A Numpy approach to the Monty Hall problem
author: Tino Margely
---
This was my very first Data Science Project, wich is an exercise from the "OpenClassroom" e-learning platform. We first started to approach the Monty Hall Probem using only python list and functions. The objective of this exerecise was to understand the potential and efficiency of Numpy over simple Pyhon lists.
-## My first Data Science Project
+## My first Data Science project
-----
-### The Monty Hall Problem
+### The Monty Hall problem
> " The Monty Hall problem is a brain teaser, in the form of a probability puzzle, loosely based on the American television game show Let's Make a Deal and named after its original host, Monty Hall. The problem was originally posed (and solved) in a letter by Steve Selvin to the American Statistician in 1975 (Selvin 1975a), (Selvin 1975b). It became famous as a question from a reader's letter quoted in Marilyn vos Savant's "Ask Marilyn" column in Parade magazine in 1990 (vos Savant 1990a):
> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia).
-### Model The problem with Numpy
+### Model the problem with Numpy
To model this problem I first started by importing all the libraries needed and created two numpy arrays. We will give to each door a different number, from 0 to 2. The first array called choix_joueur (Player's choice) picks up a random number between 0 and 2 represents a randomly chosen door for the player. The second array called bonne_porte (Good door) represents the door hiding the car. We also introduce a variable "n" wich representing the number of games we want to simulate.
```python
From fc415f2c82b434dc21cf547bb4b652d332b2ec67 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:14:09 +0100
Subject: [PATCH 29/85] Update _config.yml
---
_config.yml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_config.yml b/_config.yml
index cd116488c..5a8ea818e 100644
--- a/_config.yml
+++ b/_config.yml
@@ -6,7 +6,7 @@
name: Tino Margely
# Short bio or description (displayed in the header)
-description: Aspiring Data Scientist from France.
+description: Aspiring Data Scientist from France
#
From 2ddbf9ebda512822f5a071b4cede7ec59fa80974 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:17:44 +0100
Subject: [PATCH 30/85] Update _config.yml
---
_config.yml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_config.yml b/_config.yml
index 5a8ea818e..a848daf04 100644
--- a/_config.yml
+++ b/_config.yml
@@ -20,7 +20,7 @@ footer-links:
facebook:
flickr:
github: TinoMargely
- instagram:tinomargely
+ instagram: tinomargely
linkedin:
pinterest:
rss: # just type anything here for a working RSS icon
From 03dea389b25e1cafb39c1a5d7cd09e828ac45274 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:19:57 +0100
Subject: [PATCH 31/85] Update
2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
---
_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
index dd77b8024..d90c5c9e8 100644
--- a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
+++ b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
@@ -13,7 +13,7 @@ This was my very first Data Science Project, wich is an exercise from the "OpenC
> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia).
### Model the problem with Numpy
-To model this problem I first started by importing all the libraries needed and created two numpy arrays. We will give to each door a different number, from 0 to 2. The first array called choix_joueur (Player's choice) picks up a random number between 0 and 2 represents a randomly chosen door for the player. The second array called bonne_porte (Good door) represents the door hiding the car. We also introduce a variable "n" wich representing the number of games we want to simulate.
+To model this problem I first started by importing all the libraries needed and created two numpy arrays. We will give to each door a different number, from 0 to 2. The first array called choix_joueur (Player's choice) picks up a random number between 0 and 2 represents a randomly chosen door for the player. The second array, called bonne_porte (Good door), represents the door hiding the car. We also introduce a variable "n" wich representing the number of games we want to simulate.
```python
import matplotlib.pyplot as plt
From 64dc6e34063017b2032abd646ce24ca602fac433 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:29:37 +0100
Subject: [PATCH 32/85] Update _highlights.scss
---
_sass/_highlights.scss | 4 ++--
1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/_sass/_highlights.scss b/_sass/_highlights.scss
index 57c7b72f0..1b4669a0c 100644
--- a/_sass/_highlights.scss
+++ b/_sass/_highlights.scss
@@ -7,7 +7,7 @@
-webkit-box-shadow: 3px 3px rgba(0,0,0,0.1);
box-shadow: 3px 3px rgba(0,0,0,0.1);
margin: 20px 0 20px 0;
- overflow: scroll;
+ overflow: auto;
}
code {
@@ -81,4 +81,4 @@ code {
.highlight .vc { color: #268BD2 } /* Name.Variable.Class */
.highlight .vg { color: #268BD2 } /* Name.Variable.Global */
.highlight .vi { color: #268BD2 } /* Name.Variable.Instance */
-.highlight .il { color: #2AA198 } /* Literal.Number.Integer.Long */
\ No newline at end of file
+.highlight .il { color: #2AA198 } /* Literal.Number.Integer.Long */
From 91f3ea49b4c25753cc24f4a94d336914f89e2e56 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:52:32 +0100
Subject: [PATCH 33/85] Update _highlights.scss
---
_sass/_highlights.scss | 8 ++++----
1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/_sass/_highlights.scss b/_sass/_highlights.scss
index 1b4669a0c..f7858b6e4 100644
--- a/_sass/_highlights.scss
+++ b/_sass/_highlights.scss
@@ -1,11 +1,11 @@
.highlight {
- background-color: #efefef;
- padding: 7px 7px 7px 10px;
+ background-color: #e8ecf2;
+ /*padding: 7px 7px 7px 10px; */
border: 1px solid #ddd;
- -moz-box-shadow: 3px 3px rgba(0,0,0,0.1);
+ /*-moz-box-shadow: 3px 3px rgba(0,0,0,0.1);
-webkit-box-shadow: 3px 3px rgba(0,0,0,0.1);
- box-shadow: 3px 3px rgba(0,0,0,0.1);
+ box-shadow: 3px 3px rgba(0,0,0,0.1);*/
margin: 20px 0 20px 0;
overflow: auto;
}
From c1207289cf79203e51b6bbe8b0e03274dc95a70a Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:56:47 +0100
Subject: [PATCH 34/85] Update _highlights.scss
---
_sass/_highlights.scss | 8 ++++----
1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/_sass/_highlights.scss b/_sass/_highlights.scss
index f7858b6e4..5682206a9 100644
--- a/_sass/_highlights.scss
+++ b/_sass/_highlights.scss
@@ -1,12 +1,12 @@
.highlight {
background-color: #e8ecf2;
- /*padding: 7px 7px 7px 10px; */
+ padding: 7px 7px 7px 10px;
border: 1px solid #ddd;
- /*-moz-box-shadow: 3px 3px rgba(0,0,0,0.1);
+ -moz-box-shadow: 3px 3px rgba(0,0,0,0.1);
-webkit-box-shadow: 3px 3px rgba(0,0,0,0.1);
- box-shadow: 3px 3px rgba(0,0,0,0.1);*/
- margin: 20px 0 20px 0;
+ box-shadow: 3px 3px rgba(0,0,0,0.1);
+ /*margin: 20px 0 20px 0;*/
overflow: auto;
}
From bc8cb1c6bebb19c7a803aea7285767cab6f5ccb5 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 22:59:55 +0100
Subject: [PATCH 35/85] Update _highlights.scss
---
_sass/_highlights.scss | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_sass/_highlights.scss b/_sass/_highlights.scss
index 5682206a9..fc19d3305 100644
--- a/_sass/_highlights.scss
+++ b/_sass/_highlights.scss
@@ -1,6 +1,6 @@
.highlight {
- background-color: #e8ecf2;
+ background-color: #f2f2f2;
padding: 7px 7px 7px 10px;
border: 1px solid #ddd;
-moz-box-shadow: 3px 3px rgba(0,0,0,0.1);
From a73a92e857464a687e815d34dc674de53d241c89 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 23:01:51 +0100
Subject: [PATCH 36/85] Update _highlights.scss
---
_sass/_highlights.scss | 3 ++-
1 file changed, 2 insertions(+), 1 deletion(-)
diff --git a/_sass/_highlights.scss b/_sass/_highlights.scss
index fc19d3305..4c8a9eab7 100644
--- a/_sass/_highlights.scss
+++ b/_sass/_highlights.scss
@@ -1,6 +1,7 @@
.highlight {
- background-color: #f2f2f2;
+ /*#f2f2f2*/
+ background-color: #f9f9f9;
padding: 7px 7px 7px 10px;
border: 1px solid #ddd;
-moz-box-shadow: 3px 3px rgba(0,0,0,0.1);
From 18f1a68a8fd54b9cd4edd38d38d3b76e4d188d42 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 23:06:12 +0100
Subject: [PATCH 37/85] Update _highlights.scss
---
_sass/_highlights.scss | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_sass/_highlights.scss b/_sass/_highlights.scss
index 4c8a9eab7..2fad8dbf1 100644
--- a/_sass/_highlights.scss
+++ b/_sass/_highlights.scss
@@ -20,7 +20,7 @@ code {
.highlight .g { color: #93A1A1 } /* Generic */
.highlight .k { color: #859900 } /* Keyword */
.highlight .l { color: #93A1A1 } /* Literal */
-.highlight .n { color: #93A1A1 } /* Name */
+.highlight .n { color: #354459 } /* Name */
.highlight .o { color: #859900 } /* Operator */
.highlight .x { color: #CB4B16 } /* Other */
.highlight .p { color: #93A1A1 } /* Punctuation */
From 72f484caf26dfe57e96862e6f94cdeea40a810b4 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 23:12:27 +0100
Subject: [PATCH 38/85] Update _highlights.scss
---
_sass/_highlights.scss | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_sass/_highlights.scss b/_sass/_highlights.scss
index 2fad8dbf1..d8dec1219 100644
--- a/_sass/_highlights.scss
+++ b/_sass/_highlights.scss
@@ -23,7 +23,7 @@ code {
.highlight .n { color: #354459 } /* Name */
.highlight .o { color: #859900 } /* Operator */
.highlight .x { color: #CB4B16 } /* Other */
-.highlight .p { color: #93A1A1 } /* Punctuation */
+.highlight .p { color: #859900 } /* Punctuation */
.highlight .cm { color: #586E75 } /* Comment.Multiline */
.highlight .cp { color: #859900 } /* Comment.Preproc */
.highlight .c1 { color: #586E75 } /* Comment.Single */
From 4f5a2fba633560e04227af66d66e63ac09192d19 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 23:15:34 +0100
Subject: [PATCH 39/85] Update _highlights.scss
---
_sass/_highlights.scss | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_sass/_highlights.scss b/_sass/_highlights.scss
index d8dec1219..56d94b2b1 100644
--- a/_sass/_highlights.scss
+++ b/_sass/_highlights.scss
@@ -56,7 +56,7 @@ code {
.highlight .ne { color: #CB4B16 } /* Name.Exception */
.highlight .nf { color: #268BD2 } /* Name.Function */
.highlight .nl { color: #93A1A1 } /* Name.Label */
-.highlight .nn { color: #93A1A1 } /* Name.Namespace */
+.highlight .nn { color: #C6462B } /* Name.Namespace */
.highlight .nx { color: #555 } /* Name.Other */
.highlight .py { color: #93A1A1 } /* Name.Property */
.highlight .nt { color: #268BD2 } /* Name.Tag */
From 20be4cdfce01936128bc78fe828dbcb9545d5f01 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 23:32:53 +0100
Subject: [PATCH 40/85] Update
2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
---
...A-Numpy-Approach-To-The-Minty-Hall-Project.md | 16 +++++++---------
1 file changed, 7 insertions(+), 9 deletions(-)
diff --git a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
index d90c5c9e8..b7edf2a69 100644
--- a/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
+++ b/_posts/2019-02-09-A-Numpy-Approach-To-The-Minty-Hall-Project.md
@@ -3,7 +3,7 @@ layout: post
title: A Numpy approach to the Monty Hall problem
author: Tino Margely
---
-This was my very first Data Science Project, wich is an exercise from the "OpenClassroom" e-learning platform. We first started to approach the Monty Hall Probem using only python list and functions. The objective of this exerecise was to understand the potential and efficiency of Numpy over simple Pyhon lists.
+This was my very first Data Science Project, it is an exercise from the “OpenClassroom” e-learning platform. We first started to approach the Monty Hall problem using only python list and functions. The objective of this exercise was to understand the potential and efficiency of Numpy over simple Python lists.
## My first Data Science project
-----
@@ -13,8 +13,8 @@ This was my very first Data Science Project, wich is an exercise from the "OpenC
> Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice? ", (Wikipedia).
### Model the problem with Numpy
-To model this problem I first started by importing all the libraries needed and created two numpy arrays. We will give to each door a different number, from 0 to 2. The first array called choix_joueur (Player's choice) picks up a random number between 0 and 2 represents a randomly chosen door for the player. The second array, called bonne_porte (Good door), represents the door hiding the car. We also introduce a variable "n" wich representing the number of games we want to simulate.
-
+To model this problem I first started by importing all the libraries needed and created two Numpy arrays. We will give to each door a different number, from 0 to 2. The first array called choix_joueur (Player's choice) picks up a random number between zero and two and represents a randomly chosen door for the player. The second array, called bonne_porte (Winning door), represents the door hiding the car. We also introduce a variable "n" representing the number of games we want to simulate.
+
```python
import matplotlib.pyplot as plt
import numpy as np
@@ -24,16 +24,14 @@ n=100000
choix_joueur = np.random.randint(0,3,n)
bonne_porte = np.random.randint(0,3,n)
```
- We will stock the results of the expereience in 2 numpy arrays : garder / changer (Keep /Change).
- If you decide to keep the first door you picked, you only win when your first choice is the same as the door randomly picked (seems obvious I know). On the contrary, if you decide to change your choice, picking the good door is the only way you can lose. To explain briefly, just imagine you picked one of the two wrong doors : the host reveals a goat behind one of the two doors left. Then final door is the one behind wich the car is hiding, and as you change the door you picked first you win it !
- In terms of numpy arrays, this can be illustrated like following :
+ We stock the results of the experience in two Numpy arrays: garder / changer (Keep /Change). If you decide to keep the first door you picked, you only win when your first choice is the same as the door randomly picked (seems obvious I know). On the contrary, if you decide to change your choice, picking the good door is the only way you can lose. To explain briefly, just imagine you picked one of the two wrong doors: the host reveals a goat behind one of the two doors left. Then, final door is the one behind which the car is hiding, and as you change the door you picked first you win it! In terms of Numpy arrays, this can be illustrated like following:
```python
garder = bonne_porte[bonne_porte == choix_joueur]
changer = bonne_porte[choix_joueur != bonne_porte]
```
### Results
-In order to get some intuituve results, I decided to give 1 point to a player everytime he wins the game and ploted the number of wins for each strategy, by playing 100,000 games first and then I compared the number of wins for each strategy depending on the number of games played.
+In order to get some intuitive results, I decided to give 1 point to a player every time he wins the game and plotted the number of wins for each strategy. First, by playing 100,000 games and then I compared the number of wins for each strategy depending on the number of games played.
```python
samples = [1000, 10000, 20000, 50000, 80000, 100000]
@@ -58,8 +56,8 @@ ax2.set_title("Gain des joueurs en fonction du nombre de parties")
ax2.scatter(samples, [play_game(i)[0] for i in samples],c='r')
ax2.scatter(samples, [play_game(i)[1] for i in samples], c='g')
```
-#### And here are the results :
+##### And here are the results :
-In the end, it is clear that the best strategy is to change the door from your first choice if you want to win the car !
+##### In the end, it is clear that the best strategy is to change the door from your first choice if you want to win the car !
From 35de0436937e0bdf62118946ad66468b44b8c1ad Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 23:35:30 +0100
Subject: [PATCH 41/85] Update _config.yml
---
_config.yml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/_config.yml b/_config.yml
index a848daf04..6c6ef8961 100644
--- a/_config.yml
+++ b/_config.yml
@@ -6,7 +6,7 @@
name: Tino Margely
# Short bio or description (displayed in the header)
-description: Aspiring Data Scientist from France
+description: Aspiring Data Scientist from France.
#
From f87ccfaae5c6c0dee02a32e021a32ba09d5ec911 Mon Sep 17 00:00:00 2001
From: TinoMargely <39158369+TinoMargely@users.noreply.github.com>
Date: Sat, 9 Feb 2019 23:44:49 +0100
Subject: [PATCH 42/85] Delete avatar.jpg
---
images/avatar.jpg | Bin 13580 -> 0 bytes
1 file changed, 0 insertions(+), 0 deletions(-)
delete mode 100644 images/avatar.jpg
diff --git a/images/avatar.jpg b/images/avatar.jpg
deleted file mode 100644
index 7448f900cc91a9fd854cdacdc44a85a4df80e58e..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001
literal 13580
zcmeIZcUV(R*EhOD??~^2Dk>#(qy|I;L_krxfJm>Q6DbLTfHV;hP!NNFVgsaC3B5>_
zsuZaf5F}9uK|=U8dO!F3e9wEIbDj5G=lpT5>rD0}GkdQoYt5S3>$hfd`2KJaIClP=
z@i_njfdJRQ4{*4|bl(8!Vh2zPNE!+rAxSVxp$5<$4THR@ypkY=7Qm>W
zuBh-^s7msJ6c+)SKXUqAljQH3j^$7&HB{R;Bz7&?PHo5qAbvwk3JB!r`YTXUQyv8x
z5Z+MJ(tx-VjCAyj^mKF#APQw*W?*1s0s}2Q3oA1d%Tf9_!~{zpl>#p&I$F9TivL;o
z12N}-IZBAw{|_;N+W*f(%(W9mAf)(zDpq8|z0HZIEU_JjK+0H@Ix%vof#kJv!XMQg
ztTH)TKmN)evRCAC_v%w#qd|O$o0-j~?~UB95u(heFP)||D;KKMJ9O0XaeiyQxR1lLk|;;uAuV2`v5ArnnAB|hPVcjs)g$1
zv>DufVV~%6wM1YOOA;++&En+{>JSL5)y7X-M?Heo1g%BghR^qQMV8)qc23sW=Gjzu
zp(X@xJKdOrSGmGJZ-@y!73w$jH5J#}LHy19_`$#12_cIP?J;A6f=6##=>KuU>o?vP
zhZLW5+j3O?By~*@?QgUR@||y9?b09fPDoYS!eK82t(X*w+JCMt(039q=g)K!NAJyG
zD0QfbAB4Da%@Zok=6*`-nvrgN22>d*j$db#E3|d>-0L+7D%}LRFkd^EBwYp-u+$Bt
zr|*+ttu~o#mN;ekqXo??AQjS9**?~|Wa=#|Htacx&rJL)Zn$*YKV1^l`@F4j#Ktyg
zsB5;Y(h^8Prkf&PQ>jK!eJoxaGdR5XS*EHhTgd-S_q7S)w7(^MyMBbY&?ltZE^Qid
zyHV$U{E4>eUqqd~<^%{&jhyh_@GM&NB$^gRGN-^(qGTyh+kaJZUC3&LUmV-~61n-F
z0T+Z8hsl5^^h<@yJJ6)`3+v7E$Zl4=Z7=DBr)(=v(nhwX9*8qp;ZoHw7$S<#u@Z9w
zA3xrm!+m{Yn_==s5`>f`qQ2tM1oKf(r-P3pf~F__r0;%Ntus*%$5w$aO4v%DP4Qz&
zcQb9xr)!|f-e&}fclK_j8Ce;+?j~*7ElC-}P(g?4w=sBVf4mRz;f2G_g}eV+O(WlN
z_R9@nGVi!%1v#-C;WK+NgDb@Ls&94*l?}1v@7NvuHs1+X;pS!2)ey)=z8}WKL<`}O
zg^xQ8KRozeEoeh8`g~_V