User:Ledrug/bits: Difference between revisions
mNo edit summary |
No edit summary |
||
(8 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
<lang c>#include <stdio.h> |
<lang c>#include <stdio.h> |
||
#include <stdlib.h> |
|||
#include <stdint.h> |
|||
#include <math.h> |
|||
#define N 100 |
|||
#define D 6 |
|||
typedef float flt; |
|||
typedef struct { flt p1, p2; int32_t hold; } strat; |
|||
strat ** prob; |
|||
#define P(op, sc, h) (prob[(op) * N + (sc)][h]) |
|||
inline flt better(strat * p) { |
|||
return p->hold ? p->p1 : p->p2; |
|||
} |
|||
inline flt p_better(int op, int sc, int h) { |
|||
return better(&P(op, sc, h)); |
|||
} |
|||
#define FOR(x, n) for (x = 0; x < n; x++) |
|||
void mkarray() |
|||
{ |
|||
int i, j; |
|||
prob = malloc(sizeof(*prob) * N * N); |
|||
strat * pp = calloc(sizeof(*pp), N * N * (N + 1) / 2); |
|||
FOR(i, N) FOR(j, N) |
|||
prob[i * N + j] = pp, pp += N - j; |
|||
} |
|||
int step_array() |
|||
{ |
|||
int converged = 1; |
|||
int i, j, k, r; |
|||
FOR(i, N) FOR(j, N) FOR(k, N - j) { |
|||
strat *p = &P(i, j, k); |
|||
flt p_current = p_better(i, j, k), chance1, chance2; |
|||
chance1 = 1 - p_better(j + k, i, 0); // if holding |
|||
chance2 = 1 - p_better(j, i, 0); // if rolling |
|||
for (r = 2; r <= D; r++) |
|||
chance2 += (j + k + r >= N) ? 1 : p_better(i, j, k + r); |
|||
chance2 /= D; |
|||
p->p1 = chance1; |
|||
p->p2 = chance2; |
|||
p->hold = k && chance1 > chance2; |
|||
if (converged && fabs(p_better(i, j, k) - p_current) > 1e-4) |
|||
converged = 0; |
|||
} |
|||
return converged; |
|||
} |
|||
void write_array() |
|||
{ |
|||
int i, j, k; |
|||
FOR(i, N) { |
|||
FOR(j, N - i) { |
|||
printf("%2d %2d: ", i, j); |
|||
FOR(k, N) { |
|||
strat *p = &P(k,i,j); |
|||
putchar(p->hold ? '.' : 'R'); |
|||
printf("(%.3f %.3f) ", p->p1, p->p2); |
|||
} |
|||
putchar('\n'); |
|||
} |
|||
putchar('\n'); |
|||
} |
|||
} |
|||
int main(void) |
|||
{ |
|||
int i = 0; |
|||
mkarray(); |
|||
while (!step_array()) |
|||
fprintf(stderr, "iter %d\n", ++i); |
|||
write_array(); |
|||
return 0; |
|||
}</lang> |
|||
<lang c>#include <ucontext.h> |
|||
#include <stdlib.h> |
|||
#include <stdio.h> |
|||
#include <stdarg.h> |
|||
#include <string.h> |
#include <string.h> |
||
struct hist_t { |
|||
int b = 99, u = 1; |
|||
ucontext_t caller, callee; |
|||
char *d[16], y[] = "#:ottle/ of:eer_ a_Go<o5st>y some6_Take8;do" |
|||
void **in, *out; |
|||
"wn4pa=1rou7_17 _<h;_ m?_nd_ on_085wall_ b_e _" |
|||
int first; |
|||
" t_ss it_?4bu_ore_9, 0.@, 9$"; |
|||
struct hist_t *prev; |
|||
#define eq == |
|||
} *hist; |
|||
#define ne =! |
|||
#define xor ^= |
|||
void backtrack() { |
|||
#define nz(x) !(x=0) |
|||
if (!hist) { |
|||
#define or(x, z) else if (c eq x && nz(c) &&(c ne z)); |
|||
puts("backtracking exhausted"); |
|||
int p(char *x) |
|||
abort(); |
|||
} |
|||
setcontext(&hist->callee); |
|||
} |
|||
ucontext_t* hpush() |
|||
{ |
{ |
||
struct hist_t *h = malloc(sizeof(*h)); |
|||
char *s = x; |
|||
h->in = 0; |
|||
h->out = 0; |
|||
for (d[c=0]=y; !x && (d[c+1] = strchr(s=d[c], '_')); *(d[++c]++)=0); |
|||
h->prev = hist; |
|||
hist = h; |
|||
return &hist->caller; |
|||
} |
|||
void hpop() { |
|||
for (x = s?:x; (c = *s++); c?putchar(c):0) { |
|||
struct hist_t *s = hist; |
|||
if (!(((c xor 48) & ~0xf) &&(c xor 48))) p(d[c]), c = 0; |
|||
hist = hist->prev; |
|||
or('$', p(b-99 ? ".\n":".") && p(b-99 ? x : "")) |
|||
or('@', c && p(d[!!b--+2])) |
|||
if (s->in) free(s->in); |
|||
or('/', c && p(b^1?"s":"")) |
|||
free(s->callee.uc_stack.ss_sp); |
|||
or('#', b++ ? p("So6"+--b): !printf("%d", b?--b:(b += 99))) |
|||
free(s); |
|||
or('S', !(++u%3)*32 + 78) |
|||
or('.', puts(".")) |
|||
backtrack(); |
|||
} |
|||
void yield(void *p) |
|||
{ |
|||
hist->out = p; |
|||
swapcontext(&hist->callee, &hist->caller); |
|||
} |
|||
void hinit(void **in, void (*func)()) |
|||
{ |
|||
if (!hist->in) { |
|||
hist->in = in; |
|||
getcontext(&hist->callee); |
|||
hist->callee.uc_stack.ss_sp = malloc(4096); |
|||
hist->callee.uc_stack.ss_size = 4096; |
|||
hist->callee.uc_link = &hist->caller; |
|||
makecontext(&hist->callee, func, 0); |
|||
setcontext(&hist->callee); |
|||
} |
} |
||
return c; |
|||
} |
} |
||
#define amb (getcontext(hpush())+_amb) |
|||
int main() |
|||
void *_amb(int n, ...) |
|||
{ |
{ |
||
void iter() { |
|||
int i; |
|||
for (i = 0; hist->in[i]; i++) |
|||
yield(hist->in[i]); |
|||
hpop(); |
|||
} |
|||
int i; |
|||
va_list ap; |
|||
void **buf = calloc((1 + n), sizeof(buf[0])); |
|||
va_start(ap, n); |
|||
for (i = 0; i < n; i++) |
|||
buf[i] = va_arg(ap, void*); |
|||
va_end(ap); |
|||
hinit(buf, iter); |
|||
return hist->out; |
|||
} |
|||
int main(void) |
|||
{ |
|||
int join(char *a, char *b) { |
|||
return a[strlen(a) - 1] == b[0]; |
|||
} |
|||
char *a = amb(3, "the", "that", "a"), |
|||
*b = amb(3, "frog", "elephant", "thing"), |
|||
*c = amb(3, "walked", "treaded", "grows"), |
|||
*d = amb(3, "slowly", "quickly", "deathly"); |
|||
if (join(a, b) && join(b, c) && join(c, d)) |
|||
printf("%s %s %s %s\n", a, b, c, d); |
|||
else |
|||
amb(0); |
|||
// should put a backtrack barrier here |
|||
int s[] = {1, 2, 3, 4}; |
|||
int x = *(int*)amb(4, s, s+1, s+2, s+3); |
|||
int y = *(int*)amb(3, s, s+1, s+2); |
|||
int z = *(int*)amb(3, s, s+1, s+2); |
|||
//if (! (x > y && y < z && z < x && (x > 4))) // make "thing grows slowly" |
|||
if (! (x > y && y < z && z < x && !(x & 1))) |
|||
backtrack(); |
|||
printf("%d %d %d\n", x, y, z); |
|||
return 0; |
|||
}</lang> |
}</lang> |
||
<lang lisp>(defmacro or= (x y) `(setf ,x (logior ,x ,y))) |
|||
(defmacro and= (x y) `(setf ,x (logand ,x ,y))) |
|||
(defconstant +N+ 1) |
|||
(defconstant +S+ 2) |
|||
(defconstant +W+ 4) |
|||
(defconstant +E+ 8) |
|||
(defconstant +V+ 16) |
|||
(defun show-maze (a) |
|||
(let ((h (1- (array-dimension a 0))) |
|||
(w (1- (array-dimension a 1))) |
|||
(g " │││─┘┐┤─└┌├─┴┬┼")) |
|||
(write-line "") |
|||
(loop for y from 0 to h do |
|||
(loop for x from 0 to w do |
|||
(format t "~c" (char g (logand (aref a y x) (lognot +V+))))) |
|||
(format t "~%")))) |
|||
(defun make-maze (w h) |
|||
(let* (xs (size (* (1- w) (1- h))) |
|||
(w2 (* 2 w)) (h2 (* 2 h)) |
|||
(walls (make-array (list (1+ h2) (1+ w2)) |
|||
:element-type 'integer :initial-element 0))) |
|||
(flet ((visit (y x) (or= (aref walls y x) +V+)) |
|||
(rand-element (list r) |
|||
(loop for x in list with c = 1 with sel do |
|||
(if (zerop (random c)) (setf sel x)) |
|||
(incf c r) |
|||
finally (return sel))) |
|||
(connect (c1 c2) |
|||
(let ((y1 (car c1)) (y2 (car c2)) |
|||
(x1 (cdr c1)) (x2 (cdr c2))) |
|||
(if (= x1 x2) |
|||
(progn (or= (aref walls (min y1 y2) x1) +S+) |
|||
(or= (aref walls (1+ (min y1 y2)) x1) +S+) |
|||
(or= (aref walls (1+ (min y1 y2)) x1) +N+) |
|||
(or= (aref walls (max y1 y2) x1) +N+)) |
|||
(progn (or= (aref walls y1 (min x1 x2)) +E+) |
|||
(or= (aref walls y1 (1+ (min x1 x2))) +E+) |
|||
(or= (aref walls y1 (1+ (min x1 x2))) +W+) |
|||
(or= (aref walls y1 (max x1 x2)) +W+))))) |
|||
(neighbor (cell) |
|||
(loop with cnt = 0 with next-cell |
|||
for (dy dx) in '((-2 0) (2 0) (0 2) (0 -2)) do |
|||
(let ((y (+ (car cell) dy)) (x (+ (cdr cell) dx))) |
|||
(if (and (array-in-bounds-p walls y x) |
|||
(not (logtest (aref walls y x) +V+)) |
|||
(zerop (random (incf cnt)))) |
|||
(setf next-cell (cons y x)))) |
|||
finally (return next-cell)))) |
|||
(setf xs (append |
|||
(loop for y from 0 to h |
|||
collect (cons (* 2 y) 0) collect (cons (* 2 y) w2) |
|||
do (let ((y2 (* 2 y))) |
|||
(visit y2 0) (visit y2 w2) |
|||
(when (< y2 h2) |
|||
(connect (cons y2 0) (cons (+ 2 y2) 0)) |
|||
(connect (cons y2 w2) (cons (+ 2 y2) w2))))) |
|||
(loop for x from 0 to w |
|||
collect (cons 0 (* 2 x)) collect (cons h2 (* 2 x)) |
|||
do (let ((x2 (* 2 x))) |
|||
(visit 0 x2) (visit h2 x2) |
|||
(when (< x2 w2) |
|||
(connect (cons 0 x2) (cons 0 (+ 2 x2))) |
|||
(connect (cons h2 x2) (cons h2 (+ 2 x2)))))))) |
|||
(loop while xs do |
|||
;(let* ((c (elt xs (random (length xs)))) (c2 (neighbor c))) |
|||
(let* ((c (rand-element xs 100)) (c2 (neighbor c))) |
|||
;(let* ((c (first xs)) (c2 (neighbor c))) |
|||
(cond ((not c2) (setf xs (remove c xs :test #'equal))) |
|||
(t (connect c c2) |
|||
(visit (car c2) (cdr c2)) |
|||
(decf size) |
|||
(push c2 xs) |
|||
)))) |
|||
(show-maze walls)))) |
|||
(print (make-maze 42 25))</lang> |
Latest revision as of 21:26, 16 September 2012
<lang c>#include <stdio.h>
- include <stdlib.h>
- include <stdint.h>
- include <math.h>
- define N 100
- define D 6
typedef float flt; typedef struct { flt p1, p2; int32_t hold; } strat; strat ** prob;
- define P(op, sc, h) (prob[(op) * N + (sc)][h])
inline flt better(strat * p) { return p->hold ? p->p1 : p->p2; }
inline flt p_better(int op, int sc, int h) { return better(&P(op, sc, h)); }
- define FOR(x, n) for (x = 0; x < n; x++)
void mkarray() { int i, j; prob = malloc(sizeof(*prob) * N * N); strat * pp = calloc(sizeof(*pp), N * N * (N + 1) / 2);
FOR(i, N) FOR(j, N) prob[i * N + j] = pp, pp += N - j; }
int step_array() { int converged = 1; int i, j, k, r;
FOR(i, N) FOR(j, N) FOR(k, N - j) { strat *p = &P(i, j, k);
flt p_current = p_better(i, j, k), chance1, chance2;
chance1 = 1 - p_better(j + k, i, 0); // if holding
chance2 = 1 - p_better(j, i, 0); // if rolling for (r = 2; r <= D; r++) chance2 += (j + k + r >= N) ? 1 : p_better(i, j, k + r); chance2 /= D;
p->p1 = chance1; p->p2 = chance2; p->hold = k && chance1 > chance2;
if (converged && fabs(p_better(i, j, k) - p_current) > 1e-4) converged = 0; }
return converged; }
void write_array() { int i, j, k; FOR(i, N) { FOR(j, N - i) { printf("%2d %2d: ", i, j); FOR(k, N) { strat *p = &P(k,i,j); putchar(p->hold ? '.' : 'R'); printf("(%.3f %.3f) ", p->p1, p->p2); } putchar('\n'); } putchar('\n'); } }
int main(void) { int i = 0; mkarray();
while (!step_array()) fprintf(stderr, "iter %d\n", ++i);
write_array();
return 0; }</lang>
<lang c>#include <ucontext.h>
- include <stdlib.h>
- include <stdio.h>
- include <stdarg.h>
- include <string.h>
struct hist_t { ucontext_t caller, callee; void **in, *out; int first; struct hist_t *prev; } *hist;
void backtrack() { if (!hist) { puts("backtracking exhausted"); abort(); } setcontext(&hist->callee); }
ucontext_t* hpush() { struct hist_t *h = malloc(sizeof(*h)); h->in = 0; h->out = 0; h->prev = hist; hist = h; return &hist->caller; }
void hpop() { struct hist_t *s = hist; hist = hist->prev;
if (s->in) free(s->in); free(s->callee.uc_stack.ss_sp); free(s);
backtrack(); }
void yield(void *p) { hist->out = p; swapcontext(&hist->callee, &hist->caller); }
void hinit(void **in, void (*func)()) { if (!hist->in) { hist->in = in; getcontext(&hist->callee); hist->callee.uc_stack.ss_sp = malloc(4096); hist->callee.uc_stack.ss_size = 4096; hist->callee.uc_link = &hist->caller; makecontext(&hist->callee, func, 0); setcontext(&hist->callee); } }
- define amb (getcontext(hpush())+_amb)
void *_amb(int n, ...) { void iter() { int i; for (i = 0; hist->in[i]; i++) yield(hist->in[i]); hpop(); }
int i; va_list ap; void **buf = calloc((1 + n), sizeof(buf[0]));
va_start(ap, n); for (i = 0; i < n; i++) buf[i] = va_arg(ap, void*); va_end(ap);
hinit(buf, iter); return hist->out; }
int main(void) { int join(char *a, char *b) { return a[strlen(a) - 1] == b[0]; }
char *a = amb(3, "the", "that", "a"), *b = amb(3, "frog", "elephant", "thing"), *c = amb(3, "walked", "treaded", "grows"), *d = amb(3, "slowly", "quickly", "deathly");
if (join(a, b) && join(b, c) && join(c, d)) printf("%s %s %s %s\n", a, b, c, d); else amb(0);
// should put a backtrack barrier here
int s[] = {1, 2, 3, 4};
int x = *(int*)amb(4, s, s+1, s+2, s+3); int y = *(int*)amb(3, s, s+1, s+2); int z = *(int*)amb(3, s, s+1, s+2);
//if (! (x > y && y < z && z < x && (x > 4))) // make "thing grows slowly" if (! (x > y && y < z && z < x && !(x & 1))) backtrack();
printf("%d %d %d\n", x, y, z);
return 0; }</lang>
<lang lisp>(defmacro or= (x y) `(setf ,x (logior ,x ,y))) (defmacro and= (x y) `(setf ,x (logand ,x ,y)))
(defconstant +N+ 1) (defconstant +S+ 2) (defconstant +W+ 4) (defconstant +E+ 8) (defconstant +V+ 16)
(defun show-maze (a)
(let ((h (1- (array-dimension a 0)))
(w (1- (array-dimension a 1))) (g " │││─┘┐┤─└┌├─┴┬┼"))
(write-line "") (loop for y from 0 to h do
(loop for x from 0 to w do (format t "~c" (char g (logand (aref a y x) (lognot +V+))))) (format t "~%"))))
(defun make-maze (w h)
(let* (xs (size (* (1- w) (1- h)))
(w2 (* 2 w)) (h2 (* 2 h)) (walls (make-array (list (1+ h2) (1+ w2)) :element-type 'integer :initial-element 0)))
(flet ((visit (y x) (or= (aref walls y x) +V+))
(rand-element (list r) (loop for x in list with c = 1 with sel do (if (zerop (random c)) (setf sel x)) (incf c r) finally (return sel))) (connect (c1 c2) (let ((y1 (car c1)) (y2 (car c2)) (x1 (cdr c1)) (x2 (cdr c2))) (if (= x1 x2) (progn (or= (aref walls (min y1 y2) x1) +S+) (or= (aref walls (1+ (min y1 y2)) x1) +S+) (or= (aref walls (1+ (min y1 y2)) x1) +N+) (or= (aref walls (max y1 y2) x1) +N+)) (progn (or= (aref walls y1 (min x1 x2)) +E+) (or= (aref walls y1 (1+ (min x1 x2))) +E+) (or= (aref walls y1 (1+ (min x1 x2))) +W+) (or= (aref walls y1 (max x1 x2)) +W+))))) (neighbor (cell) (loop with cnt = 0 with next-cell for (dy dx) in '((-2 0) (2 0) (0 2) (0 -2)) do (let ((y (+ (car cell) dy)) (x (+ (cdr cell) dx))) (if (and (array-in-bounds-p walls y x) (not (logtest (aref walls y x) +V+)) (zerop (random (incf cnt)))) (setf next-cell (cons y x)))) finally (return next-cell))))
(setf xs (append
(loop for y from 0 to h collect (cons (* 2 y) 0) collect (cons (* 2 y) w2) do (let ((y2 (* 2 y))) (visit y2 0) (visit y2 w2) (when (< y2 h2) (connect (cons y2 0) (cons (+ 2 y2) 0)) (connect (cons y2 w2) (cons (+ 2 y2) w2))))) (loop for x from 0 to w collect (cons 0 (* 2 x)) collect (cons h2 (* 2 x)) do (let ((x2 (* 2 x))) (visit 0 x2) (visit h2 x2) (when (< x2 w2) (connect (cons 0 x2) (cons 0 (+ 2 x2))) (connect (cons h2 x2) (cons h2 (+ 2 x2))))))))
(loop while xs do
;(let* ((c (elt xs (random (length xs)))) (c2 (neighbor c))) (let* ((c (rand-element xs 100)) (c2 (neighbor c))) ;(let* ((c (first xs)) (c2 (neighbor c))) (cond ((not c2) (setf xs (remove c xs :test #'equal))) (t (connect c c2) (visit (car c2) (cdr c2)) (decf size) (push c2 xs) ))))
(show-maze walls))))
(print (make-maze 42 25))</lang>