diff --git a/exercises/practice/darts/.approaches/booleans-as-ints/content.md b/exercises/practice/darts/.approaches/booleans-as-ints/content.md
new file mode 100644
index 0000000000..d54327e2ac
--- /dev/null
+++ b/exercises/practice/darts/.approaches/booleans-as-ints/content.md
@@ -0,0 +1,7 @@
+# Using Boolean Values as Integers
+
+```python
+def score(x_coord, y_coord):
+    radius = (x_coord**2 + y_coord**2)
+    return (radius<=1)*5 + (radius<=25)*4 +(radius<=100)*1
+```
\ No newline at end of file
diff --git a/exercises/practice/darts/.approaches/booleans-as-ints/snippet.txt b/exercises/practice/darts/.approaches/booleans-as-ints/snippet.txt
new file mode 100644
index 0000000000..ec7dcfabbf
--- /dev/null
+++ b/exercises/practice/darts/.approaches/booleans-as-ints/snippet.txt
@@ -0,0 +1,3 @@
+def score(x_coord, y_coord):
+    radius = (x_coord**2 + y_coord**2)
+    return (radius<=1)*5 + (radius<=25)*4 +(radius<=100)*1
\ No newline at end of file
diff --git a/exercises/practice/darts/.approaches/config.json b/exercises/practice/darts/.approaches/config.json
new file mode 100644
index 0000000000..aa93e2aebe
--- /dev/null
+++ b/exercises/practice/darts/.approaches/config.json
@@ -0,0 +1,50 @@
+{
+  "introduction": {
+    "authors": ["bethanyg"],
+    "contributors": []
+  },
+  "approaches": [
+    {
+      "uuid": "7d78f598-8b4c-4f7f-89e1-e8644e934a4c",
+      "slug": "if-statements",
+      "title": "Use If Statements",
+      "blurb": "Use if-statements to check scoring boundaries for a dart toss.",
+      "authors": ["bethanyg"]
+    },
+    {
+      "uuid": "f8f5533a-09d2-4b7b-9dec-90f268bfc03b",
+      "slug": "tuple-and-loop",
+      "title": "Use a Tuple & Loop through Scores",
+      "blurb": "Score the Dart toss by looping through a tuple of scores.",
+      "authors": ["bethanyg"]
+    },
+    {
+      "uuid": "a324f99e-15bb-43e0-9181-c1652094bc4f",
+      "slug": "match-case",
+      "title": "Use Structural Pattern Matching ('Match-Case')",
+      "blurb": "Use a Match-Case (Structural Pattern Matching) to score the dart toss.)",
+      "authors": ["bethanyg"]
+    },
+    {
+      "uuid": "966bd2dd-c4fd-430b-ad77-3a304dedd82e",
+      "slug": "dict-and-generator",
+      "title": "Use a Dictionary with a Generator Expression",
+      "blurb": "Use a generator expression looping over a scoring dictionary, getting the max score for the dart toss.",
+      "authors": ["bethanyg"]
+    },
+    {
+      "uuid": "5b087f50-31c5-4b84-9116-baafd3a30ed6",
+      "slug": "booleans-as-ints",
+      "title": "Use Boolean Values as Integers",
+      "blurb": "Use True and False as integer values to calculate the score of the dart toss.",
+      "authors": ["bethanyg"]
+    },
+    {
+      "uuid": "0b2dbcd3-f0ac-45f7-af75-3451751fd21f",
+      "slug": "dict-and-dict-get",
+      "title": "Use a Dictionary with dict.get",
+      "blurb": "Loop over a dictionary and retrieve score via dct.get.",
+      "authors": ["bethanyg"]
+    }
+  ]
+}
\ No newline at end of file
diff --git a/exercises/practice/darts/.approaches/dict-and-dict-get/content.md b/exercises/practice/darts/.approaches/dict-and-dict-get/content.md
new file mode 100644
index 0000000000..11919ad63c
--- /dev/null
+++ b/exercises/practice/darts/.approaches/dict-and-dict-get/content.md
@@ -0,0 +1,14 @@
+# Using a Dictionary and `dict.get()`
+
+```python
+def score(x_coord, y_coord):
+    point = (x_coord**2 + y_coord**2)
+    scores = {
+        point <= 100: 1,
+        point <= 25: 5,
+        point <= 1: 10
+    }
+    
+    return scores.get(True, 0)
+```
+
diff --git a/exercises/practice/darts/.approaches/dict-and-dict-get/snippet.txt b/exercises/practice/darts/.approaches/dict-and-dict-get/snippet.txt
new file mode 100644
index 0000000000..6d496f54d3
--- /dev/null
+++ b/exercises/practice/darts/.approaches/dict-and-dict-get/snippet.txt
@@ -0,0 +1,5 @@
+def score(x_coord, y_coord):
+    point = (x_coord**2 + y_coord**2)
+    scores = {point <= 100: 1, point <= 25: 5, point <= 1: 10}
+
+    return scores.get(True, 0)
\ No newline at end of file
diff --git a/exercises/practice/darts/.approaches/dict-and-generator/content.md b/exercises/practice/darts/.approaches/dict-and-generator/content.md
new file mode 100644
index 0000000000..d93894baf2
--- /dev/null
+++ b/exercises/practice/darts/.approaches/dict-and-generator/content.md
@@ -0,0 +1,12 @@
+# Use a Dictionary and a Generator Expression
+
+```python
+def score(x_coord, y_coord):
+    length = x_coord**2 + y_coord**2
+    rules = {1.0: 10, 25.0: 5, 100.0: 1, 200: 0}
+    score = max(point for 
+                distance, point in 
+                rules.items() if length <= distance)
+
+    return score
+```
\ No newline at end of file
diff --git a/exercises/practice/darts/.approaches/dict-and-generator/snippet.txt b/exercises/practice/darts/.approaches/dict-and-generator/snippet.txt
new file mode 100644
index 0000000000..f6649cf3a9
--- /dev/null
+++ b/exercises/practice/darts/.approaches/dict-and-generator/snippet.txt
@@ -0,0 +1,8 @@
+def score(x_coord, y_coord):
+    length = x_coord**2 + y_coord**2
+    rules = {1.0: 10, 25.0: 5, 100.0: 1, 200: 0}
+    score = max(point for
+                distance, point in
+                rules.items() if length <= distance)
+
+    return score
\ No newline at end of file
diff --git a/exercises/practice/darts/.approaches/if-statements/content.md b/exercises/practice/darts/.approaches/if-statements/content.md
new file mode 100644
index 0000000000..68092f587b
--- /dev/null
+++ b/exercises/practice/darts/.approaches/if-statements/content.md
@@ -0,0 +1,26 @@
+# Use `if-statements`
+
+```python
+import math
+
+# Checks scores from the center --> edge.
+def score(x_coord, y_coord):
+    distance = math.sqrt(x_coord**2 + y_coord**2)
+    
+    if distance <= 1: return 10
+    if distance <= 5: return  5
+    if distance <= 10: return  1
+    
+    return 0
+    
+# ##OR##
+
+# Checks scores from the edge --> center
+def score(x_coord, y_coord):
+    distance = math.sqrt(x_coord**2 + y_coord**2)
+    
+    if distance > 10: return 0
+    if 5 < distance <= 10: return 1
+    if 1 < distance <= 5: return 5
+    if distance <= 1: return 10
+```
diff --git a/exercises/practice/darts/.approaches/if-statements/snippet.txt b/exercises/practice/darts/.approaches/if-statements/snippet.txt
new file mode 100644
index 0000000000..18537416e2
--- /dev/null
+++ b/exercises/practice/darts/.approaches/if-statements/snippet.txt
@@ -0,0 +1,8 @@
+import math
+
+def score(x_coord, y_coord):
+    distance = math.sqrt(x_coord**2 + y_coord**2)
+    if distance <= 1: return 10
+    if distance <= 5: return  5
+    if distance <= 10: return  1
+    return 0
\ No newline at end of file
diff --git a/exercises/practice/darts/.approaches/introduction.md b/exercises/practice/darts/.approaches/introduction.md
new file mode 100644
index 0000000000..1884a03891
--- /dev/null
+++ b/exercises/practice/darts/.approaches/introduction.md
@@ -0,0 +1,180 @@
+# Introduction
+
+
+There are multiple  Pythonic ways to solve the Darts exercise.
+Among them are:
+
+- Using if statements
+- Using a tuple (or list or dict) and a for loop
+- Using a dict (or tuple or list) and a `generator-expression`
+- Using boolean values as ints
+- Using a dict and dict.get()
+- Using `match/case` (_Python 3.10+ only_)
+
+
+
+## General guidance
+
+The goal of the Darts exercise is to score a single toss in a Darts game.
+The scoring areas are _concentric circles_, so boundary values need to be checked in order to properly score a toss.
+The key is to determine how far from the center the dart lands (_by calculating sqrt(x**2 + y**2), or a variation_) and then determine what scoring ring it falls into.
+
+
+**_Order matters_** - each bigger target circle contains all the smaller circles, so the most straightforward solution is to check the smallest circle first.
+Otherwise, you must box your scoring by checking both a _lower bound_ and an _upper bound_.
+
+
+Darts that fall on a _boundary_ are scored based on the area below the line (_closer to center_).
+
+
+## Approach: Using `if` statements
+
+
+```python
+import math
+
+# Checks scores from the center --> edge.
+def score(x_coord, y_coord):
+    distance = math.sqrt(x_coord**2 + y_coord**2)
+    
+    if distance <= 1: return 10
+    if distance <= 5: return  5
+    if distance <= 10: return  1
+    
+    return 0
+
+  ###OR##
+
+# Checks scores from the edge --> center
+def score(x_coord, y_coord):
+    distance = math.sqrt(x_coord**2 + y_coord**2)
+    
+    if distance > 10: return 0
+    if 5 < distance <= 10: return 1
+    if 1 < distance <= 5: return 5
+    if distance <= 1: return 10
+```
+
+
+This approach uses [concept:python/conditionals]() to check the boundaries for each scoring ring, returning the corresponding score.
+Because the `if-statements` are simple and readable, they're written on one line to shorten the function body.
+
+One variant checks from the center, moving outward.
+Zero is returned if no other if check is true.
+
+The other variant checks from the edge, moving inward, and includes an explicit check for the zero case.
+To avoid importing the `math` module, (x**2 +y**2) can be calculated instead, and the scoring rings can be adjusted to 1, 25, and 100.
+
+For more details, see the [if statements][approach-if-statements] approach.
+
+
+## Approach: Using a `tuple` and a  `loop`
+
+```python
+def score(x_coord, y_coord):
+    distance = x_coord**2 + y_coord**2
+    rules = (1.0, 10), (25.0, 5), (100.0, 1), (200.0, 0)
+    
+    for distance, point in rules:
+        if length <= distance:
+            return point
+```
+
+
+This approach loops through the _rules_ `tuple`, unpacking each `distance` and corresponding`score`.
+If the calculated distance of the toss is less than or equal to a given distance, the point score is returned.
+For more details, see the [tuple and loop][approach-tuple-and-loop] approach.
+
+
+## Approach: Using a `dict` with a `generator-expression`
+
+```python
+def score(x_coord, y_coord):
+    length = x_coord**2 + y_coord**2
+    rules = {1.0: 10, 25.0: 5, 100.0: 1, 200: 0}
+    score = max(point for 
+                distance, point in 
+                rules.items() if length <= distance)
+
+    return score
+```
+
+This approach is very similar to the  [tuple and loop][approach-tuple-and-loop] approach, but iterates over [`dict.items()`][dict-items],  and writes the `loop` as a [`generator-expression`][generator-expression] inside `max()`.
+For more information, see the [dict with generator-expression][approach-dict-with-generator-expression]  approach.
+
+
+## Approach: Using Boolean Values as Integers
+
+```python
+def score(x_coord, y_coord):
+    radius = (x_coord**2 + y_coord**2)
+    return (radius<=1)*5 + (radius<=25)*4 +(radius<=100)*1
+```
+
+
+This approach exploits Boolean values as integers.
+
+In Python, the boolean values `True` and `False` are _subclasses_ of `int` , and can be interpreted as `0` (False) and `1` (True) in a mathematical context.
+
+For more information, see the [boolean values as integers][approach-boolean-values-as-integers]  approach.
+
+
+## Approach: Using a `Dictionary` and `dict.get()`
+
+```python
+def score(x_coord, y_coord):
+    point = (x_coord**2 + y_coord**2)
+    scores = {
+        point <= 100: 1,
+        point <= 25: 5,
+        point <= 1: 10
+    }
+    
+    return scores.get(True, 0)
+```
+
+This approach uses a dictionary to hold the distance --> scoring mappings and `dict.get()` to retrieve the correct points value.
+For more details, read the [`Dictionary and dict.get()`][approach-dict-and-dict-get]  approach.
+
+
+## Approach:  Using `match/case` (structural pattern matching)
+
+```python
+from math import hypot, ceil
+
+
+def score(x, y):
+    match ceil(hypot(x, y)):
+        case 0 | 1: return 10
+        case 2 | 3 | 4 | 5: return 5
+        case 6 | 7 | 8 | 9 | 10: return 1
+        case _: return 0
+
+```
+
+
+This approach uses Python 3.10's [`structural pattern matching`][structural-pattern-matching], with return values on the same line as `case`.
+A fallthrough case (`_`) is used if the dart throw is outside the outer circle of the target (_greater than 10_).
+For more details, see the [structural pattern matching][approach-struct-pattern-matching] approach.
+
+
+## Which approach to use?
+
+Many of these approaches are a matter of personal preference - there aren't significant memory or performance differences.
+That being said, ___ is the fastest and __ the slowest for the test data.
+
+# TODO: add in the details here!
+
+To compare the performance and other tradeoffs of the approaches, take a look at the [Performance article][article-performance].
+
+
+[approach-boolean-values-as-integers]:  https://exercism.org/tracks/python/exercises/darts/approaches/boolean-values-as-integers
+[approach-dict-and-dict-get]:  https://exercism.org/tracks/python/exercises/darts/approaches/dict-and-dict-get
+[approach-dict-with-generator-expression]:  https://exercism.org/tracks/python/exercises/darts/approaches/dict-with-gnerator-expresson
+[approach-if-statements ]:  https://exercism.org/tracks/python/exercises/darts/approaches/if-statements
+[approach-struct-pattern-matching]:  https://exercism.org/tracks/python/exercises/darts/approaches/struct-pattern-matching
+[approach-tuple-and-loop]:  https://exercism.org/tracks/python/exercises/darts/approaches/tuple-and-loop
+[article-performance]:https://exercism.org/tracks/python/exercises/darts/articles/performance
+[structural-pattern-matching]: https://peps.python.org/pep-0636/
+[dict-items]: https://docs.python.org/3/library/stdtypes.html#dict.items
+[generator-expression]: https://dbader.org/blog/python-generator-expressions
diff --git a/exercises/practice/darts/.approaches/match-case/content.md b/exercises/practice/darts/.approaches/match-case/content.md
new file mode 100644
index 0000000000..f14dd506ca
--- /dev/null
+++ b/exercises/practice/darts/.approaches/match-case/content.md
@@ -0,0 +1,13 @@
+# Use `match/case` (Structural Pattern Matching)
+
+```python
+from math import hypot, ceil
+
+
+def score(x, y):
+    match ceil(hypot(x, y)):
+        case 0 | 1: return 10
+        case 2 | 3 | 4 | 5: return 5
+        case 6 | 7 | 8 | 9 | 10: return 1
+        case _: return 0
+```
diff --git a/exercises/practice/darts/.approaches/match-case/snippet.txt b/exercises/practice/darts/.approaches/match-case/snippet.txt
new file mode 100644
index 0000000000..e66b5382b2
--- /dev/null
+++ b/exercises/practice/darts/.approaches/match-case/snippet.txt
@@ -0,0 +1,8 @@
+from math import hypot, ceil
+
+def score(x, y):
+    match ceil(hypot(x, y)):
+        case 0 | 1: return 10
+        case 2 | 3 | 4 | 5: return 5
+        case 6 | 7 | 8 | 9 | 10: return 1
+        case _: return 0
\ No newline at end of file
diff --git a/exercises/practice/darts/.approaches/tuple-and-loop/content.md b/exercises/practice/darts/.approaches/tuple-and-loop/content.md
new file mode 100644
index 0000000000..3f589e229e
--- /dev/null
+++ b/exercises/practice/darts/.approaches/tuple-and-loop/content.md
@@ -0,0 +1,11 @@
+# Use a tuple and Loop
+
+```python
+def score(x_coord, y_coord):
+    distance = x_coord**2 + y_coord**2
+    rules = (1.0, 10), (25.0, 5), (100.0, 1), (200.0, 0)
+    
+    for distance, point in rules:
+        if length <= distance:
+            return point
+```
diff --git a/exercises/practice/darts/.approaches/tuple-and-loop/snippet.txt b/exercises/practice/darts/.approaches/tuple-and-loop/snippet.txt
new file mode 100644
index 0000000000..ad50500526
--- /dev/null
+++ b/exercises/practice/darts/.approaches/tuple-and-loop/snippet.txt
@@ -0,0 +1,7 @@
+def score(x_coord, y_coord):
+    distance = x_coord**2 + y_coord**2
+    rules = (1.0, 10), (25.0, 5), (100.0, 1), (200.0, 0)
+
+    for distance, point in rules:
+        if length <= distance:
+            return point
\ No newline at end of file