Maths Problem

Alright, so I'm building an VST. Just i've got a problem which I can't figure out the answer too, who ever can figure out a working answer (there may not be one) gets the VST I'm making (my VST's are never released therefore you will have one of two in the world) plus unlimited updates for the VST. The VST is a type of filter delay.

Problem:

I have switches A,B,C. Each switch can either be on or off.

These switches can be connected to each other in two different ways:

1) Unison, meaning that when one switch is turned on the switch connected too it is also turned on.

2) Reverse, meaning that when a switch is turned on the switch connected to it is turned off.

All 3 switches can connect to each other in either reverse or unison, however there can only be one connection from one switch to another, i.e A can not be connected to B and then B routed back into A as this would cause a loop and crash my computer.

In any connection between two switches there is one 'master' and one 'slave' the master controls the slave but not the other away round. i.e. If switch A is the master and B is the slave and they are connected in unison then pressing A would activate B but pressing B would not activate A.

Is there a way of connecting switches A,B and C so that when you switch one of them on it turns the other two off?

Go.

Edit: If you win you will have to wait for your prize as it'll take a while to complete the VST.

What are you building the VST in ? If it's as low-level as C++ then I would've thought it would be easy to do a simple 'if{} then{}' type logic ...

is this a joke?

a is b's master, a and b are in reverse mode

b is c's master, b and c are in unison mode

turn a on

edit: i'm a programmer myself. if you deem me as having won, wanna collaborate on this vst? i'd love to work on some code. i've done a few vsts before.

double edit: ahh, nevermind. i imagine you meant it should work for any switch?

triple edit: if the graph was completely connected, with all edges in reverse mode this would work. the only problem is the master/slave shit. if you mandate there be a master/slave system and impose the limit of one edge per pair of vertices, this problem is unsolvable. just wrote it all out :x

what are you using? synthedit, or is it in code? This is too vague.

  On 3/5/2010 at 6:50 AM, Bubba69 said:

what are you using? synthedit, or is it in code? This is too vague.

i'd like it if it was in c++ too :s

wait, are you saying that you already have created this "reverse" and "unison" function in the switch or is that part of the problem? I'm actually interested in figuring this out i just have no idea where to start because I don't understand the context fully. Do you have some sort of switch that designates how it is operating? Is this a function that will be controlled by the user or are you just going to hardwire something in?

step one would be to write out a truth table

better yet, a k-map

Max, would you like to have a try?

  On 3/6/2010 at 12:11 AM, kaini said:

step one would be to write out a truth table

better yet, a k-map

lol yeah.. as i said earlier though if you put in 30 seconds to doing that you find out pretty quickly that, under his strict scheme, it can't work.

good thing i didn't then!

it looked cyclical, even from afar.

Thanks for teh rips people. I'm gonna use a truth table/K-map from now, but I don't you realise that this is the first bit of 'programming' I've done, so I'm not really aware of these things, I am limited to the reverse/unsion functions due Pure Data's (The prog. I'm using) objects. Biggs if you're still up for it it, would be quite interesting to try and build something together, though you have a appreciate I am somewhat a n00b at this, which means I may make some mistakes. But yeah thanks for the help guys, I'll approach the problem in a different way.

  On 3/9/2010 at 3:36 AM, Mesh Gear Fox said:

upload the patch if it's PD, you'll find some people here are quite good with PD/max

google: radio button?