View Single Post
Old Mar 27th, 2008, 11:48 PM   #5
Sane
Banned
 
Sane's Avatar
 
Join Date: Apr 2005
Location: Waterloo, Ontario
Posts: 2,101
Rep Power: 6 Sane will become famous soon enough
Send a message via MSN to Sane
Re: Techniques For Overcoming Stack Overflow In DP

Shoot.

Quote:
Under Windows platforms, the stack size information is contained in the executable files.
It can be set during compilation in Visual C++, but this is not available in gcc.
I use Dev-C++ with GCC. No changing of the stack size for me. Unless I can get a hold of a program (such as editbin.exe and dumpbin.exe) to modify it manually. Either way, I think that is a cheap way around this problem.

Edit: A correction to when I said 10-20 possible moves. Often, states have as many as 200 cross edges to different branches (200 possible moves). That's why the graph unfolds into one main branch so easily; there is almost always an undiscovered state that can be accessed. But it also means the BFS'd graph is very (very) shallow. Maybe even closer to 10 levels.
__________________
Looking for tough programming challenges? Try participating in Sane's Monthly Algorithms Challenges!
Composing Techno is a little side hobby of mine. Techno by DJ Sane. All free for download.

Last edited by Sane; Mar 28th, 2008 at 12:03 AM.
Sane is offline   Reply With Quote