diff options
| author | Adam Borowski <kilobyte@angband.pl> | 2011-08-26 14:03:54 +0200 |
|---|---|---|
| committer | Adam Borowski <kilobyte@angband.pl> | 2011-08-29 02:33:28 +0200 |
| commit | c5220e3641fa05e23f2820ac5d91a16a4ebc9f29 (patch) | |
| tree | db535f5055e05ec3ab9cbe907474394db1630175 /crawl-ref/source/dgn-delve.h | |
| parent | 94e45811bbd039351d16ee4d1dadd34692130eaa (diff) | |
| download | crawl-ref-c5220e3641fa05e23f2820ac5d91a16a4ebc9f29.tar.gz crawl-ref-c5220e3641fa05e23f2820ac5d91a16a4ebc9f29.zip | |
Reimplement Kusigrosz' layout_delve.
TODO:
* operate on vault maps rather than grd -- Zaba, would that still allow
using it as a post-processor?
* support for non-empty initial maps -- every connector needs to have enough
seed grown next to it
* some arguments tend to stop prematurely, like 3,3,0,,125 -- we may either
restart or alter the algorithm to give-back squares rejected due to failing
ngb_min; we'd need some tests, preferably on non-empty maps
* delving too much at a boundary looks ugly
Diffstat (limited to 'crawl-ref/source/dgn-delve.h')
| -rw-r--r-- | crawl-ref/source/dgn-delve.h | 7 |
1 files changed, 7 insertions, 0 deletions
diff --git a/crawl-ref/source/dgn-delve.h b/crawl-ref/source/dgn-delve.h new file mode 100644 index 0000000000..db91e47395 --- /dev/null +++ b/crawl-ref/source/dgn-delve.h @@ -0,0 +1,7 @@ +#ifndef DGN_DELVE_H +#define DGN_DELVE_H + +void layout_delve(int ngb_min = 2, int ngb_max = 3, + int connchance = 0, int cellnum = -1, int top = 125); + +#endif |