Sigi_BC84 Posted January 20, 2006 Report Share Posted January 20, 2006 Hello, the relay bidders among you might know the software "Bridge2Symmetric", which is an excellent tool to practice symmetric relay systems (of any kind). What I'm planning to do is to write a converter that will turn b2s bidding trees into a full disclosure file, for easy creation of complete symmetric relay systems descriptions. If you did this by hand you'd grow both very old and insane, I'm sure. Interference and the like will be a problem, but at least you would have a description of non-competitive auctions. Maybe competitive bidding could be done as well somehow, but I don't know enough about FD yet to be really sure about this. Who would be interested in such a tool? Is there anybody willing to help? No reverse engineering would be necessary, since Bridge2Symmetric can be decompiled into perfectly readable Java code, so one can simply use the original classes to access the bidding tree. BTW don't start looking for b2s on the Internet, it's not sold anymore. --Sigi Quote Link to comment Share on other sites More sharing options...
RalphG Posted February 8, 2006 Report Share Posted February 8, 2006 I have Bridge2Symettric and it is a good tool for symettric relays. I have also entered Scream into Full disclosure... Took me 3 days and i didnt know how to use copy and paste at that time. I may be able to help but dont know Java but am C++ Programmer and would be interested. Quote Link to comment Share on other sites More sharing options...
akhare Posted February 8, 2006 Report Share Posted February 8, 2006 Hello, the relay bidders among you might know the software "Bridge2Symmetric", which is an excellent tool to practice symmetric relay systems (of any kind). Hi there, I must have missed this somehow, but I can chip in to write such a tool -- I am pretty neutral about the choice of language... Atul Quote Link to comment Share on other sites More sharing options...
Sigi_BC84 Posted February 8, 2006 Author Report Share Posted February 8, 2006 I was planning to write this in Ruby, actually, since this is the most fun language I know (and highly effective as well, a lot more than Java, C++ or even Perl). The main problem about this project is reading in the Bridge2Symmetric system files. I'm at the moment trying to work out the file format -- this is only a matter of time, and made quite easy by the fact that the original b2sym can be decompiled to readable source code. A quick solution would be to simply use the original classes from b2sym to read in the files and generate the FD sequences. However, this would make redistribution of the tool illegal (one might argue that this is not that much of a problem since b2sym is more or less abandonware anyway). Also, one would then have to understand the complete object structure of b2sym, which is not much easier than understanding how to read in the files. As soon as you have a means to read the system descriptions it's fairly straightforward to generate FD files from these (more or less a matter of traversing the bidding tree and generating all possible bidding sequences along the way). Also this could make for a nice basis for an alternative to the original Full Disclosure editor (which I'm not really fond of, although it's working). Contact me by mail if you want to assist: frank at luithle dot net --Sigi Quote Link to comment Share on other sites More sharing options...
Sigi_BC84 Posted February 8, 2006 Author Report Share Posted February 8, 2006 I have Bridge2Symettric and it is a good tool for symettric relays. I have also entered Scream into Full disclosure... Took me 3 days and i didnt know how to use copy and paste at that time. I may be able to help but dont know Java but am C++ Programmer and would be interested.Talking about SCREAM (and the likes) carries us straight toward the next issue: Systems that alter the relay structure dynamically based on which suits have already been bid in the current auction. This cannot be specified within Bridge2Symmetric, so one would need some kind of programmability. Along the same lines are things like interference handling and denial cue bidding which are only (or easier) to be specified using some kind of description language than using tables or trees. Using Ruby, it is in fact quite possible to create a special purpose language, but it is definitely advanced Ruby wizardry. However, it would be intriguing to have these possibilities -- it would also nicely apply to the general concept of a bidding system editor. I'm not entirely sure how well the static nature of the FD files is suited towards such complexity. After all, you will have to be able to enumerate all possible bidding sequences. --Sigi Quote Link to comment Share on other sites More sharing options...
Recommended Posts