Hi,
Im new to javascript... so bare with me.
I wrote a depth first negamax search engine in C for a tic-tac-toe program, which I've been working on translating to javascript for my webpage, and I am confident that the algorithms in my javascript match those in my working C program. What I've observed is, when a recursive call backs up from the bottom of the search tree, the values of the leaves have overwritten the values stored in the nodes above (as if it uses the same memory reference instead of storing old values to the stack for reuse later). I'll post the code when I get home, but for now my question is this... does javascript properly support recursion? Are there any documented limitations?
Also, if there is some kind of free javascript debugging tool... I'd appriciate anyone pointing me to that. using IE and alert statements to test is annoying.
Im new to javascript... so bare with me.
I wrote a depth first negamax search engine in C for a tic-tac-toe program, which I've been working on translating to javascript for my webpage, and I am confident that the algorithms in my javascript match those in my working C program. What I've observed is, when a recursive call backs up from the bottom of the search tree, the values of the leaves have overwritten the values stored in the nodes above (as if it uses the same memory reference instead of storing old values to the stack for reuse later). I'll post the code when I get home, but for now my question is this... does javascript properly support recursion? Are there any documented limitations?
Also, if there is some kind of free javascript debugging tool... I'd appriciate anyone pointing me to that. using IE and alert statements to test is annoying.