Here you go, just use the tree abstraction and create named nodes for every event in your story!
Note that the nodes are hard coded to send to "master", you'd want another "master" receiver for your GEM abstraction to select the image which goes with the current node.
Oh, and of course replace the PD selector patch, which sends random 0 or 1, with your actual voting mechanism.
~David
On 5/6/07, David Powers cyborgk@gmail.com wrote:
I think I will try to do a quick prototype and email it to you in 15-20 minutes. ~David
On 5/6/07, Jared linux@fridaythang.com wrote:
David,
Thanks for the reply. That's basically what I want to do. My concern is that there are around 80 nodes which have to be displayed in specific if-then sequences (if it's at node 12 and the vote is A, go to node 33, if the vote is B go to node 37). My understanding of PD means this isn't *impossible*, it'll just be a bit clunky. If you have any suggestions to the contrary, I'd love to hear 'em.
Thanks again! -Jared
David Powers wrote:
Maybe I'm misunderstanding something, but what is it you want to display in gem exactly? If, say, you had an image for every possible node of the story, this would be trivial to implement. You just give each possible story node a name, and send the name as a message. Then some abstraction you build in PD/Gem takes the name as input, and outputs the appropriate image.
~David
On 5/5/07, Jared linux@fridaythang.com wrote:
I have very approximate version of the voting working in PD but am unsure how to do the visual output. What I'd like to do is have PD send the vote information (that is, who won) to another program, either something I'll write or PowerPoint or the like, to run the display.
I know PD can do visual output through Gem, but in exploring Gem I couldn't figure out an easy way to have the branching paths work, whereas branching paths in PowerPoint or in a homemade program could be relatively easy.
Hallo, David Powers hat gesagt: // David Powers wrote:
Here you go, just use the tree abstraction and create named nodes for every event in your story!
Note that the nodes are hard coded to send to "master", you'd want another "master" receiver for your GEM abstraction to select the image which goes with the current node.
Oh, and of course replace the PD selector patch, which sends random 0 or 1, with your actual voting mechanism.
~David
On 5/6/07, David Powers cyborgk@gmail.com wrote:
I think I will try to do a quick prototype and email it to you in 15-20 minutes. ~David
On 5/6/07, Jared linux@fridaythang.com wrote:
David,
Thanks for the reply. That's basically what I want to do. My concern is that there are around 80 nodes which have to be displayed in specific if-then sequences (if it's at node 12 and the vote is A, go to node 33, if the vote is B go to node 37). My understanding of PD means this isn't *impossible*, it'll just be a bit clunky. If you have any suggestions to the contrary, I'd love to hear 'em.
I attached another solution to your problem, which may be easier to extend to 80 nodes, because not much patching is involved, instead you write a textfile with a definition of your state transitions (because basically what you seem to long for is just that: a state machine).
The idea is to write a textfile where every line represents a certain state of your system indicated by the line number. The content of a line then specifies the possible transitions.
In the example patch every state has two possible follow-up states written as numbers. Depending on the choice of a user (0 or 1 in the example) a new state is selected by selecting either the first or the second follow-up state and making that the new active state.
Ciao
Frank Barknecht _ ______footils.org_ __goto10.org__
I thought of something like your solution too, Frank, I'll have to give it an inspection after I get off work.
As for my own solution, I decided that it could be very useful for Markov Chain / random walk type of operations, especially when they are more cyclical and NOT tree structures. For a smaller number of states, say under 20, it would be really easy to prototype using the node method where you simply chain things together. In fact, an AI generative music machine would greatly benefit from being able to do such a walk.
However, is there any method for making dynamic select and number of outlets in a node, without coding an external? Or would it be simpler to hard-code the node abstraction with more outlets and let the user choose to use less?
Also, I decided it would be nice to have node names in some kind of namespace for the node, where it has the form 'name.message'. The idea is that while the name might be unique, messages might not. This would make it easy to write linear chord structures as a chain of dataflow objects. So I'm trying to remember, can .39 vanilla PD split a symbol based on some delimiter, such as '.' (decimal) ? It seems like I rely on zexy for things like this sometimes! Or do I need to give the abstraction both a name, and a message parameter?
~David
On 5/7/07, Frank Barknecht fbar@footils.org wrote:
Hallo, David Powers hat gesagt: // David Powers wrote:
Here you go, just use the tree abstraction and create named nodes for every event in your story!
Note that the nodes are hard coded to send to "master", you'd want another "master" receiver for your GEM abstraction to select the image which goes with the current node.
Oh, and of course replace the PD selector patch, which sends random 0 or 1, with your actual voting mechanism.
~David
On 5/6/07, David Powers cyborgk@gmail.com wrote:
I think I will try to do a quick prototype and email it to you in 15-20 minutes. ~David
On 5/6/07, Jared linux@fridaythang.com wrote:
David,
Thanks for the reply. That's basically what I want to do. My concern is that there are around 80 nodes which have to be displayed in specific if-then sequences (if it's at node 12 and the vote is A, go to node 33, if the vote is B go to node 37). My understanding of PD means this isn't *impossible*, it'll just be a bit clunky. If you have any suggestions to the contrary, I'd love to hear 'em.
I attached another solution to your problem, which may be easier to extend to 80 nodes, because not much patching is involved, instead you write a textfile with a definition of your state transitions (because basically what you seem to long for is just that: a state machine).
The idea is to write a textfile where every line represents a certain state of your system indicated by the line number. The content of a line then specifies the possible transitions.
In the example patch every state has two possible follow-up states written as numbers. Depending on the choice of a user (0 or 1 in the example) a new state is selected by selecting either the first or the second follow-up state and making that the new active state.
Ciao
Frank Barknecht _ ______footils.org_ __goto10.org__
PD-list@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list
David,
Thanks again for your help with the multiple path voting. Your patches have been extremely useful. I was hoping to pick your brain on one or two things.
I did have a question concerning looking ahead. With your patches (node and tree) is there any way to see future the children of nodes? I've very successfully used your patch with gem's ability to display text to have the name of a node displayed in a gem window by passing [r master] to the text display patch.
What I'd like to also do is have the text display the voting choices. That is, at node dolphin the patch would display octopus and lobster.
Is that information accessible, or am I out of luck?
As a side note, is there any way to give nodes names with spaces? I've been using underscores (node_name) which works well but is a little ugly.
Thanks again for all your help, -Jared
David Powers wrote:
Here you go, just use the tree abstraction and create named nodes for every event in your story!
Note that the nodes are hard coded to send to "master", you'd want another "master" receiver for your GEM abstraction to select the image which goes with the current node.
Oh, and of course replace the PD selector patch, which sends random 0 or 1, with your actual voting mechanism.
~David
On 5/6/07, David Powers cyborgk@gmail.com wrote:
I think I will try to do a quick prototype and email it to you in 15-20 minutes. ~David
On 5/6/07, Jared linux@fridaythang.com wrote:
David,
Thanks for the reply. That's basically what I want to do. My concern is that there are around 80 nodes which have to be displayed in specific if-then sequences (if it's at node 12 and the vote is A, go to node 33, if the vote is B go to node 37). My understanding of PD means this
isn't
*impossible*, it'll just be a bit clunky. If you have any
suggestions to
the contrary, I'd love to hear 'em.
Thanks again! -Jared
David Powers wrote:
Maybe I'm misunderstanding something, but what is it you want to display in gem exactly? If, say, you had an image for every possible node of the story, this would be trivial to implement. You just give each possible story node a name, and send the name as a message. Then some abstraction you build in PD/Gem takes the name as input, and outputs the appropriate image.
~David
On 5/5/07, Jared linux@fridaythang.com wrote:
I have very approximate version of the voting working in PD but am unsure how to do the visual output. What I'd like to do is have
PD send
the vote information (that is, who won) to another program, either something I'll write or PowerPoint or the like, to run the display.
I know PD can do visual output through Gem, but in exploring Gem I couldn't figure out an easy way to have the branching paths work, whereas branching paths in PowerPoint or in a homemade program
could be
relatively easy.
Hallo, Jared hat gesagt: // Jared wrote:
What I'd like to also do is have the text display the voting choices. That is, at node dolphin the patch would display octopus and lobster.
Is that information accessible, or am I out of luck?
If you use my [textfile] based solution, then you already have that information available from the line in the textfile.
Ciao
Frank Barknecht _ ______footils.org_ __goto10.org__
Yes, I would second the recommendation to use Frank's method. I'm continuing work on extending my own solution quick and dirty solution, but I have a rather different use scenario in mind (visual/dataflow method for creating generative chord progressions similar to diagrams I used to create on paper for improvisors).
~David
On 5/15/07, Frank Barknecht fbar@footils.org wrote:
Hallo, Jared hat gesagt: // Jared wrote:
What I'd like to also do is have the text display the voting choices. That is, at node dolphin the patch would display octopus and lobster.
Is that information accessible, or am I out of luck?
If you use my [textfile] based solution, then you already have that information available from the line in the textfile.
Ciao
Frank Barknecht _ ______footils.org_ __goto10.org__
PD-list@iem.at mailing list UNSUBSCRIBE and account-management -> http://lists.puredata.info/listinfo/pd-list
-
David Powers -
Frank Barknecht -
Jared