v50 Steam/Premium information for editors
- v50 information can now be added to pages in the main namespace. v0.47 information can still be found in the DF2014 namespace. See here for more details on the new versioning policy.
- Use this page to report any issues related to the migration.
This notice may be cached—the current version can be found here.
Editing User talk:0x517A5D
Jump to navigation
Jump to search
Warning: You are not logged in.
Your IP address will be recorded in this page's edit history.
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 1: | Line 1: | ||
− | == | + | == Current Build == |
− | + | Interesting setup you've got there. I run something similar, though not completely abusive to game limits. (Leg+5 in everything? comeon! :P) | |
− | + | Got one guy with proficient in everything, while the rest have no skills and are purely haulers and pre-dabbling farmers. | |
− | + | Hauling and farming were the only tasks I decided to free my 'hero' dwarf from, since they're so god-awfully time consuming. | |
− | |||
− | + | As for items: A single full suit of steel armor and one of each weapon, with only a handful of bolts, should an errant fire imp come over in the first season. | |
− | + | A couple dozen of each booze and both plump helmet and spawn, with 11 each of the remaining seeds. | |
− | + | Of course the mandatory 1 each of food and whatnot. | |
+ | A hefty stock of giant cave spider thread to jumpstart my trading power (a single shoe will go for no less than 900 I think... initial investment is only 120p each) | ||
+ | A miscellany of assorted bars, wood, ores, and stone to spend the remaining points. | ||
+ | Also took along 3 wardogs for some additional protection and 10 cattle to get a herd going. | ||
− | + | All-in-all I limit myself to 32000 total points, as it's the highest clean number that the signed integer will accept in a once-off edit. | |
+ | Also used adjust start to give me 10 dwarves, and set Max_Pop to only 7, so no immigrants unless I get really short on helpers. | ||
+ | |||
+ | My guy's got something of a demi-god complex too, as his name is Master, the rest are named Servant, and the world is "Kôr Nòm" (Master of God). Remembered to look it up when I dabbled with the Regional Prospector ;) | ||
+ | |||
+ | Anyways, saw that you had a very similar idea for a build and thought you might want to hear you're not the only one going for the "God and Servants" route ;) | ||
+ | --[[User:n9103|n9103]] 01:49, 20 Dec 2007 (PST) | ||
+ | |||
+ | == Search Function == | ||
+ | |||
+ | It may be helpful to make it clear the search function used in your version-independent code examples is a user-define function and is not associated with the STL search algorithm. I would also recommend posting the source files for search function, or commenting that they are available from the enable magma buildings zip file | ||
+ | |||
+ | --[[User:Masdus|Masdus]] 22:08, 28 November 2007 (EST) | ||
+ | |||
+ | :That's a good point about search(). I've just renamed it hexsearch() in my most recent (not yet released) source.<br/>I had started to document the search patterns in a more generic way, but decided that (a) it took me too long to translate, and (b) few of the target audience would be able and willing to retranslate into their own search-like functions. So I just started cutting and pasting patterns out of my source.<br/>As for posing the source to hexsearch(), I think that the target audience can track it down. (If we could host arbitrary files directly on this wiki, I would. I just think it's too big to put into a <code> block.)<br/>—[[User:0x517A5D|0x517A5D]] 16:17, 29 November 2007 (EST) | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
== Seekret Projekt == | == Seekret Projekt == | ||
Line 60: | Line 66: | ||
:::::::Maybe... Hmm. Maybe. I could make a list with little problem. The hard part would be getting the info out. I immediately envision a co-process, probably a custom debugger, that collects the information from code tweaks in DF. And either that program, or an AHK script, would feed input to DF to traverse the map. Hmm. Really, this sounds like a project that's a couple orders of magnitude harder than RP was. With RP, I just inject a few lines of carefully written assembly code. Debuggers are hard. Interesting idea, though. Also, nice m-dash.<br/>—[[User:0x517A5D|0x517A5D]] 01:24, 31 December 2007 (EST) | :::::::Maybe... Hmm. Maybe. I could make a list with little problem. The hard part would be getting the info out. I immediately envision a co-process, probably a custom debugger, that collects the information from code tweaks in DF. And either that program, or an AHK script, would feed input to DF to traverse the map. Hmm. Really, this sounds like a project that's a couple orders of magnitude harder than RP was. With RP, I just inject a few lines of carefully written assembly code. Debuggers are hard. Interesting idea, though. Also, nice m-dash.<br/>—[[User:0x517A5D|0x517A5D]] 01:24, 31 December 2007 (EST) | ||
::::::::I only copy from the best :) But anyway, as long as you're injecting assembly code, couldn't you extend it to open a file and write out the interesting features it finds? This probably wouldn't work if you're limited to a certain amount of injected code; I have to say that I have absolutely no idea whether or not this would work as I've never done anything with x86 assembly, nor have I ever messed around with injecting code into memory.<br/>—[[User:Tacroy|Tacroy]] 23:03, 31 December 2007 (EST) | ::::::::I only copy from the best :) But anyway, as long as you're injecting assembly code, couldn't you extend it to open a file and write out the interesting features it finds? This probably wouldn't work if you're limited to a certain amount of injected code; I have to say that I have absolutely no idea whether or not this would work as I've never done anything with x86 assembly, nor have I ever messed around with injecting code into memory.<br/>—[[User:Tacroy|Tacroy]] 23:03, 31 December 2007 (EST) | ||
− | |||
− | |||
− | |||
Maybe it's only me, and I'm doing something extremely stupid, but I can't get it to apply the patch. When I run the .exe it says that it can't find the files that it needs to patch, and suggests that they perhaps already are patched, which, of course, they aren't. I'm probably doing something stupid, aren't I? I suspected that I had possibly put it in the wrong place or something, so I ended up running it from a whole bunch of different DF folders. Alas, there wasn't any sort of readme to help us simple people. Help would be appreciated though, it sounds like a fantastic utility. I'm tired of looking for underground pools with the random chance method. I'm using .33g--[[User:Yabbadabba|Yabbadabba]] 00:55, 1 January 2008 (EST) | Maybe it's only me, and I'm doing something extremely stupid, but I can't get it to apply the patch. When I run the .exe it says that it can't find the files that it needs to patch, and suggests that they perhaps already are patched, which, of course, they aren't. I'm probably doing something stupid, aren't I? I suspected that I had possibly put it in the wrong place or something, so I ended up running it from a whole bunch of different DF folders. Alas, there wasn't any sort of readme to help us simple people. Help would be appreciated though, it sounds like a fantastic utility. I'm tired of looking for underground pools with the random chance method. I'm using .33g--[[User:Yabbadabba|Yabbadabba]] 00:55, 1 January 2008 (EST) | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |