diff --git a/Pasted image 20250224110124.png b/Pasted image 20250224110124.png
new file mode 100644
index 0000000..617ecbc
Binary files /dev/null and b/Pasted image 20250224110124.png differ
diff --git a/education/computer engineering/ECE2700/Karnaugh Maps.md b/education/computer engineering/ECE2700/Karnaugh Maps.md
index e3d8fa5..aa59b3c 100644
--- a/education/computer engineering/ECE2700/Karnaugh Maps.md	
+++ b/education/computer engineering/ECE2700/Karnaugh Maps.md	
@@ -17,4 +17,10 @@ To find a minimal boolean expression with a Karnaugh map, we need to find the sm
 # Three Variable Maps
 ![[Pasted image 20250224105753.png]]
 
-A three variable Karnaugh map
\ No newline at end of file
+A three variable Karnaugh map is constructed by placing 2 two-variable maps side by side. The values of $x_1$ and $x_2$ distinguish columns in the map, and the value of $x_3$ distinguishes rows in the map.
+
+To convert a 3 variable Karnaugh map to a minimal boolean expression, start by looking for places in the map that contain 1s next to each other (by row, or by column).
+
+![[Pasted image 20250224110124.png]]
+
+From there, describe the pair of 1s using boolean a
\ No newline at end of file