Sorcerer's Apprentice: Difference between revisions

From Looney Pyramid Games Wiki
Content added Content deleted
imported>Kataclysm
(Updated to correct year published.)
imported>JorWat
No edit summary
 
Line 4: Line 4:
image_link =|
image_link =|
description = |
description = |
players = 2|
max_players = 2|
stashes = 6 |
stashes = 6 |
sets = 5 [[Rainbow]] and 5 [[Xeno]] |
sets = 2, 5 ideally|
other_equip = A [[chessboard]], an [[opaque bag]], 24 checkers (12 each of 2 different colours) |
other_equip = A [[chessboard]], an [[opaque bag]], 24 checkers (12 each of 2 different colours) |
setup_time = 5 minutes |
setup_time = 5 minutes |
Line 30: Line 30:


== External Links ==
== External Links ==
* The rules are published [http://www.invisible-city.com/play/81 here].
* The rules are published [http://www.invisible-city.com/content/sorcerers-apprentice here].
* It is listed on [http://www.boardgamegeek.com/boardgame/19268 BoardGameGeek].
* It is listed on [http://www.boardgamegeek.com/boardgame/19268 BoardGameGeek].



Latest revision as of 15:38, 27 February 2020

Sorcerer's Apprentice
Jonathan Leistiko
:Players Players: 2
:Time Length: unknown
:Complexity Complexity: unknown
Trios per color: 2, 5 ideally
Number of colors: 6
Pyramid trios:
Monochr. stashes: 6
Five-color sets: 2, 5 ideally
- - - - - - Other equipment - - - - - -
A chessboard, an opaque bag, 24 checkers (12 each of 2 different colours)
Setup time: 5 minutes
Playing time:
Strategy depth: unknown
Random chance: unknown
Game mechanics:
Theme: Checkers
BGG Link: 19268
Status: Complete (v1.0), Year released: 2003



Sorcerer's Apprentice is a checkers variant designed by Jonathan Leistiko for 2 players. It requires a standard checkers set, 5 small pyramids in each of red, yellow, green, blue, purple and clear, and an opaque bag.

It could be played with 4 treehouse sets, 2 rainbow and 2 xeno, using any 5 pyramids of the relavant colours, and ignoring size.

External Links[edit | edit source]