Revolution Book Test by Ellusionist

Ellusionist have gaffed the holy hell outta this classic Sherlock Holmes book. Re-writing it to feature one of the most powerful book test principles ever devised.



For those that don't know, a 'book test' is a demonstration that allows you to tell someone a word they've chosen, at random, from a book.

With this book, you could perform that effect more than 10 times in a row - and have a different outcome each time.

Sidenote: although we don't recommend doing the same trick to the same audience 10 times. 

Because of the way it's structured, your spectator can go to ANY page, a completely free choice - and you'll be able to know their word. They can go forward, back, 2 pages, 3 pages, first line, last line - whatever.



YOU WILL KNOW THE WORD THEY ARE THINKING OF.


WHEN YOU BUY THE BOOK, YOU INSTANTLY GET OVER 1 HOUR OF TUITION FROM THE BEST MENTALIST IN THE WORLD, PETER TURNER

He will teach you: 




What sets Revolution Book Test apart from any other, is that based on the page they choose, there are multiple different routes the effect can go in.

If it's 1 page, it could be a simple word divination. If it's another, we'll teach you how to predict a memory. If it's another, it can work as a multiple prediction (confabulation) routine. If it's another, it can become a drawing duplication.


You can make it as easy or difficult as you want. You can make it look like you've memorised the book. You can also make it look like you've drawn what they chose at random. It's wild!

And because of the 9 principle baked-in, it means you could repeat it immediately after with a completely different word!


For the first time ever, this is no longer just a 'know a word' book test. This is a 'choose how you want to reveal it' book test.


We've never seen anything like it - so it's a guarantee your audiences haven't either.

Each book comes with extensive explanation videos from world-renowned mentalist, Peter Turner + a special 'crib sheet' bookmark to ensure there is no memory work required.