|
|
Go to page [Previous] 1~2 | ||||||||||
Magicmike1949 Special user 643 Posts |
Nick,
I've been to your site and want to thank you for sharing it with us. I'll be spending more time there. |
|||||||||
Nick Pudar Veteran user 369 Posts |
Mike,
No problem. It's been fun programming StackView. I have to admit, the new Search feature had my head spinning for quite a while, but it works, and I'm hopeful that someone wil put it to good use and discover some exciting new stuff. I've already had some interesting new ideas flow in for new features in the next version. Keep the ideas coming. Nick
Let me explain. No, there is too much. Let me sum up.
www.stackview.com Version 5.0 is available! |
|||||||||
Alessandro Scotti Loyal user Italy 263 Posts |
I've used a program of my own to search about nine thousand billion decks (that's 9,000,000,000,000, at a rate of about 5 millions per second) and so far no joy! There are so many decks to explore that you would really need a lucky shot!
Walk of Mind: the best source of bad magic
|
|||||||||
Nick Pudar Veteran user 369 Posts |
The way StackView handles the search is to start with any deck order (that you specify) and then try different combinations of manipulations (that you specify). It will try to find which sequence results in a match with another deck that you specify (either whole or partial deck). The problem with this approach is today's computer speeds. Consider this: with 26 maximum moves to try, and 16,071 possible manipulations per move, and conidering how many manipulations can be tried per second, if you wanted to do a complete search (all possible combinations) it could take up to 1.80 E +95 millenia (yes millenia) to calculate. Obviously not very practical. So, StackView allows you to refine the search parameters -- and hopefully somone will intelligently narrow those parameters and find the ellusive "New Deck to Aronson" sequence.
Nick
Let me explain. No, there is too much. Let me sum up.
www.stackview.com Version 5.0 is available! |
|||||||||
Alessandro Scotti Loyal user Italy 263 Posts |
Yep, same thing here. The problem is actually in tweaking the search parameters: how would one narrow them "intelligently"? My approach so far has followed the criteria of "practicality": the computer explores only moves I can do and that I think can be done more or less deceptively... as I've said, nothing yet.
Walk of Mind: the best source of bad magic
|
|||||||||
Nick Pudar Veteran user 369 Posts |
Agreed. First search the stuff you can (or would) do. But that is no guarantee that a solution will ever be found. I even toyed (briefly) with the idea of doing a SETI-like distributed search task where voluteer computers could share the search at night by parsing out the task in smaller chunks. But a quick back-of-the-envelope calculation proved that to be only a small improevement in search time -- not worth the effort at today's computer speeds. When quantum computers become available however...
Nick
Let me explain. No, there is too much. Let me sum up.
www.stackview.com Version 5.0 is available! |
|||||||||
Jay Elf Elite user 466 Posts |
Quote:
On 2003-09-28 16:18, Mike Powers wrote: Is the title of this memory effect "Unforgettable" which is in a Hartling's Card Fictions book? |
|||||||||
Magicmike1949 Special user 643 Posts |
No this is alittle different.Unforgettable is a great trick though.It's very similar to this.
|
|||||||||
Jay Elf Elite user 466 Posts |
Thanks, Magicmike1949.
|
|||||||||
The Magic Cafe Forum Index » » Shuffled not Stirred » » Aronson Stack (0 Likes) | ||||||||||
Go to page [Previous] 1~2 |
[ Top of Page ] |
All content & postings Copyright © 2001-2024 Steve Brooks. All Rights Reserved. This page was created in 0.02 seconds requiring 5 database queries. |
The views and comments expressed on The Magic Café are not necessarily those of The Magic Café, Steve Brooks, or Steve Brooks Magic. > Privacy Statement < |