any computer simulation of the match process?

[SDNer]

---

Members don't see this ad.

any programmers out there willing to write up a simulation program based on the match algorithm? i figure it can't be that difficult for a proficient programmer.

http://www.nrmp.org/res_match/about_res/algorithms.html

my head hurts trying to sort through that page...hehe.

 

[ckent]

Why do you want a computer simulation of the match? Do you want to play "residency match" on your computer?😉 It is a confusing process, but I think that the best way to go is just to ignore how the process works and just know that there's no need to strategize your picks, just put your true number one choice as number one.

 

[Yogi Bear]

Originally posted by ckent
Why do you want a computer simulation of the match? Do you want to play "residency match" on your computer?😉 It is a confusing process, but I think that the best way to go is just to ignore how the process works and just know that there's no need to strategize your picks, just put your true number one choice as number one.

let's play! j/k

on a side note, i remember the days of ap computer science in hs and writing similar programs in c++ (although much simpler). a couple of for loops, recursion, etc. should do the trick. i.e. one of them was a problem called "knight's tour" where you had to move the knight from any position to all 64 squares on the chest board. On my pentium 75, it took 3 whole hours because of my lack of coding skills. I made the computer consider every single move from Position A. If A had 4 potential moves (1,2,3,4), I'd make it examine the next move at position 1, 2, 3, 4, etc....for an exponential increase in the number of potential moves.