diff --git a/instructions/en/puzzles/sokobaniq.xml b/instructions/en/puzzles/sokobaniq.xml
new file mode 100644
index 0000000..4927ef1
--- /dev/null
+++ b/instructions/en/puzzles/sokobaniq.xml
@@ -0,0 +1,32 @@
+
+
+ Sokoban IQ
+ sokobaniq
+ The Sokoban puzzle was originally conceived by Hiroyuki Imabayashi, founder of Thinking Rabbit, a video game developer. It was released commercially in 1982.
+
+ There are an equal number of crates and targets, which can be moved by the worker.
+ Click an arrow to move the crate to one of its empty, adjacent tiles.
+ Move every crate to a designated storage location (target) on the board.
+
+
+ The worker (or player) can only move up, down, left, or right into an empty space.
+ The worker can push a single crate, but cannot pull crates.
+ Crates cannot be pushed into walls or other crates (no passing or stacking allowed).
+ The puzzle is solved when each crate is located on a target.
+
+
+ Plan your moves carefully in advance to avoid getting crates stuck in corners or narrow corridors.
+ Keep the worker behind the crates and push them toward the goals rather than moving them side-to-side unnecessarily.
+ Identify "deadlock" spaces—squares where a crate can never be pushed out—and avoid placing crates there.
+
+
+
+
+
+
+ Doris Chiang (Backend, GamesmanUni GUI Design & Implementation)
+ Kshitij Tomar (Backend, GamesmanUni GUI Implementation, Variants)
+ Abraham Hsu (Mentor, Server Debugging)
+ Allena Oglivie (Mentor)
+
+
\ No newline at end of file
diff --git a/instructions/en/puzzles/sokobanlarge.xml b/instructions/en/puzzles/sokobanlarge.xml
new file mode 100644
index 0000000..866ca6d
--- /dev/null
+++ b/instructions/en/puzzles/sokobanlarge.xml
@@ -0,0 +1,32 @@
+
+
+ Sokoban Large
+ sokobanlarge
+ The Sokoban puzzle was originally conceived by Hiroyuki Imabayashi, founder of Thinking Rabbit, a video game developer. It was released commercially in 1982.
+
+ There are an equal number of crates and targets, which can be moved by the worker.
+ Click an arrow to move the crate to one of its empty, adjacent tiles.
+ Move every crate to a designated storage location (target) on the board.
+
+
+ The worker (or player) can only move up, down, left, or right into an empty space.
+ The worker can push a single crate, but cannot pull crates.
+ Crates cannot be pushed into walls or other crates (no passing or stacking allowed).
+ The puzzle is solved when each crate is located on a target.
+
+
+ Plan your moves carefully in advance to avoid getting crates stuck in corners or narrow corridors.
+ Keep the worker behind the crates and push them toward the goals rather than moving them side-to-side unnecessarily.
+ Identify "deadlock" spaces—squares where a crate can never be pushed out—and avoid placing crates there.
+
+
+
+
+
+
+ Doris Chiang (Backend, GamesmanUni GUI Design & Implementation)
+ Kshitij Tomar (Backend, GamesmanUni GUI Implementation, Variants)
+ Abraham Hsu (Mentor, Server Debugging)
+ Allena Oglivie (Mentor)
+
+
\ No newline at end of file