How can I simulate Parrondo's games in NetLogo?

[valesdn]

Hi guys, how do you do?
I'm sorry to ask your help, (again!) but I'm having trouble using NetLogo.
I'd like to "play" with this program, to run simulations, but I have no idea how I can do it.
I wrote an article about Parrondo's games ( nothing special! ). Now, I'd like to try creating a new code for my simulations. Could you tell me what I need?
I'm looking for tutorial online (youtube and all the sites about this argument), but it is not enough.
Thanks in advance for your advices!

 

[STEMucator]

NetLogo is quite an interesting language. Especially if you have a background in graph theory.

If you need an extensive intro, here is the official NetLogo 5.2 user manual: http://ccl.northwestern.edu/netlogo/docs/

If you want more information, see this NetLogo tutorial written by Alan G. Isaac: https://subversion.american.edu/aisaac/notes/netlogo-intro.xhtml

If you are a programmer with experience, and just want to jump right in, see the NetLogo quick start guide: http://luis.izqui.org/resources/NetLogo-5-0-QuickGuide.pdf

 

[valesdn]

Hi Zondrina, thank you for answering me.
I have read the user manual on the official site of NetLogo, but it is not enough (too simple) for what I need.
I found very interesting the second link that you have selected for me.
I used to do programming in C but it was a long time ago and I don't remember nothing more.
I don't understand how I should to set up my "exercise". I'm going to look into Parrondo's paradox ( there are no tutorials on youtube): I know that game A and game B are losing games when played in isolation. Game A is a simple coin toss; game B is composed of two coins: the first one is "good", the second one is "bad".
When I switch periodically or randomly between the two losing games, surprisingly, I win.
How could I sketch out this? ( I need to put my minds - and last words - into order :)
I'm going to try to do that.