modelchecker/coord.c

   1 #include <argp.h>
   2 #include <inttypes.h>
   3 #include <locale.h>
   4 #include <stdio.h>
   5 #include <stdlib.h>
   6 #include <string.h>
   7 #include <sys/time.h>
   8
   9 #ifdef HAVE_PROFILER
  10 #include <gperftools/profiler.h>
  11 #endif
  12
  13 #include <sylvan.h>
  14 #include <llmsset.h>
  15 #include <lace.h>
  16
  17 #include "coord.h"
  18 #include "sokoban.h"
  19
  20 /*
  21  * Global TODOs for now:
  22  * - update the helper maps so it is a single bimap
  23  * - make a data structure for relations
  24  * - encode relations as a set of four relations for each move
  25  */
  26
  27 typedef struct {
  28         int x;
  29         int y;
  30 } xy;
  31
  32 typedef struct {
  33         int var[3];
  34 } bddvar;
  35
  36 typedef struct {
  37         xy key;
  38         bddvar value;
  39         UT_hash_handle hh;
  40 } xy_bddvar_map;
  41
  42 typedef struct {
  43         int key;
  44         xy value;
  45         UT_hash_handle hh;
  46 } bddvar_xy_map;
  47
  48 typedef struct {
  49         xy_bddvar_map *f;
  50         bddvar_xy_map *t;
  51 } bimap;
  52
  53 typedef struct {
  54         BDD *rell;
  55         BDD *relu;
  56         BDD *relr;
  57         BDD *reld;
  58 } rels;
  59
  60 xy_bddvar_map *getxy(int x, int y, xy_bddvar_map *map)
  61 {
  62         xy_bddvar_map k, *r = NULL;
  63         memset(&k, 0, sizeof(xy_bddvar_map));
  64         k.key.x = x;
  65         k.key.y = y;
  66         HASH_FIND(hh, map, &k.key, sizeof(xy), r);
  67         return r;
  68 }
  69
  70 bddvar_xy_map *getbdd(int key, bddvar_xy_map *map)
  71 {
  72         bddvar_xy_map k, *r = NULL;
  73         memset(&k, 0, sizeof(bddvar_xy_map));
  74         k.key = key;
  75         HASH_FIND(hh, map, &k.key, sizeof(int), r);
  76         return r;
  77 }
  78
  79 /*
  80 xy_bddvar_map *create_xy_bddvar_map(sokoban_screen *screen)
  81 {
  82         int varcount = 0;
  83         sokoban_screen *r;
  84         xy_bddvar_map *xybdd = NULL;
  85         for(r=screen; r != NULL; r = (sokoban_screen *)(r->hh.next)){
  86                 xy_bddvar_map *f = NULL;
  87                 //bddvar_xy_map *t = NULL;
  88
  89                 f = (xy_bddvar_map *)malloc(sizeof(xy_bddvar_map));
  90                 memset(f, 0, sizeof(xy_bddvar_map));
  91                 f->key.x = r->coord.x;
  92                 f->key.y = r->coord.y;
  93                 f->value.var[0] = varcount;
  94                 f->value.var[1] = varcount + 1;
  95                 f->value.var[2] = varcount + 2;
  96                 HASH_ADD(hh, xybdd, key, sizeof(xy), f);
  97                 varcount = varcount + 3;
  98         }
  99         return xybdd;
 100 }
 101
 102 bddvar_xy_map *create_bddvar_xy_map(sokoban_screen *screen)
 103 {
 104         int varcount = 0;
 105         sokoban_screen *r;
 106         bddvar_xy_map *bddxy = NULL;
 107         for(r=screen; r != NULL; r = (sokoban_screen *)(r->hh.next)){
 108                 for (int i = 0; i <3; i++){
 109                         bddvar_xy_map *f = NULL;
 110                         //bddvar_xy_map *t = NULL;
 111
 112                         f = (bddvar_xy_map *)malloc(sizeof(bddvar_xy_map));
 113                         memset(f, 0, sizeof(bddvar_xy_map));
 114                         f->key = varcount + i;
 115                         f->value.x = r->coord.x;
 116                         f->value.y = r->coord.y;
 117                         HASH_ADD(hh, bddxy, key, sizeof(int), f);
 118                 }
 119                 varcount = varcount + 3;
 120         }
 121         return bddxy;
 122 }
 123 */
 124
 125 bimap *create_bimap_helper(sokoban_screen *screen)
 126 {
 127         int varcount = 0;
 128         sokoban_screen *r;
 129         xy_bddvar_map *xybdd = NULL;
 130         bddvar_xy_map *bddxy = NULL;
 131         for(r=screen; r != NULL; r = (sokoban_screen *)(r->hh.next)){
 132                 xy_bddvar_map *f = NULL;
 133                 f = (xy_bddvar_map *)malloc(sizeof(xy_bddvar_map));
 134                 memset(f, 0, sizeof(xy_bddvar_map));
 135                 f->key.x = r->coord.x;
 136                 f->key.y = r->coord.y;
 137                 f->value.var[0] = varcount;
 138                 f->value.var[1] = varcount + 1;
 139                 f->value.var[2] = varcount + 2;
 140                 HASH_ADD(hh, xybdd, key, sizeof(xy), f);
 141
 142                 for (int i = 0; i <3; i++){
 143                         bddvar_xy_map *t = NULL;
 144                         t = (bddvar_xy_map *)malloc(sizeof(bddvar_xy_map));
 145                         memset(t, 0, sizeof(bddvar_xy_map));
 146                         t->key = varcount + i;
 147                         t->value.x = r->coord.x;
 148                         t->value.y = r->coord.y;
 149                         HASH_ADD(hh, bddxy, key, sizeof(int), t);
 150                 }
 151                 varcount = varcount + 3;
 152         }
 153         bimap *bm = NULL;
 154         bm = (bimap *)malloc(sizeof(bimap));
 155         bm->f = xybdd;
 156         bm->t = bddxy;
 157         return bm;
 158 }
 159
 160 /*
 161  * Each coordinate has three related boolean variables. The combination of those boolean variables
 162  * defines tiles:
 163  * 000: Wall
 164  * 001: Free
 165  * 010: Box
 166  * 100: Box on target
 167  * 011: Target
 168  * 101: Agent
 169  * 110: Agent on target
 170  * In the BDD representation, the state is represented by n * 3 variables, where n is the number of
 171  * tiles in the shrinked screen.
 172  * It seems that the move variable is not necessary since non-deterministic moves can be emvedded
 173  * directly in transition relations.
 174  */
 175
 176 state *encode_screen(sokoban_screen *screen)
 177 {
 178         LACE_ME;
 179
 180         BDDVAR vars[HASH_COUNT(screen) * 3];
 181         for (uint8_t i = 0; i < HASH_COUNT(screen) * 3; i++){
 182                 vars[i] = i;
 183         }
 184
 185         uint8_t st_enc[HASH_COUNT(screen) * 3];
 186
 187         BDDSET varset = sylvan_set_fromarray(vars, HASH_COUNT(screen) * 3);
 188         BDD s;
 189         state *fullState = NULL;
 190         fullState = (state *)malloc(sizeof(state));
 191         fullState->vars.varset = varset;
 192         fullState->vars.size = HASH_COUNT(screen) * 3;
 193         int tile_index = 0;
 194         sokoban_screen *r;
 195         for(r=screen; r != NULL; r = (sokoban_screen *)(r->hh.next)){
 196                 switch(r->tile){
 197                 case FREE: //001
 198                         st_enc[tile_index] = 0;
 199                         tile_index++;
 200                         st_enc[tile_index] = 0;
 201                         tile_index++;
 202                         st_enc[tile_index] = 1;
 203                         tile_index++;
 204                         break;
 205                 case WALL: //000
 206                         st_enc[tile_index] = 0;
 207                         tile_index++;
 208                         st_enc[tile_index] = 0;
 209                         tile_index++;
 210                         st_enc[tile_index] = 0;
 211                         tile_index++;
 212                         break;
 213                 case BOX: //010
 214                         st_enc[tile_index] = 0;
 215                         tile_index++;
 216                         st_enc[tile_index] = 1;
 217                         tile_index++;
 218                         st_enc[tile_index] = 0;
 219                         tile_index++;
 220                         break;
 221                 case TARGET: //011
 222                         st_enc[tile_index] = 0;
 223                         tile_index++;
 224                         st_enc[tile_index] = 1;
 225                         tile_index++;
 226                         st_enc[tile_index] = 1;
 227                         tile_index++;
 228                         break;
 229                 case AGENT: //101
 230                         st_enc[tile_index] = 1;
 231                         tile_index++;
 232                         st_enc[tile_index] = 0;
 233                         tile_index++;
 234                         st_enc[tile_index] = 1;
 235                         tile_index++;
 236                         break;
 237                 case TARGAGENT: //110
 238                         st_enc[tile_index] = 1;
 239                         tile_index++;
 240                         st_enc[tile_index] = 1;
 241                         tile_index++;
 242                         st_enc[tile_index] = 0;
 243                         tile_index++;
 244                         break;
 245                 case TARGBOX: //100
 246                         st_enc[tile_index] = 1;
 247                         tile_index++;
 248                         st_enc[tile_index] = 0;
 249                         tile_index++;
 250                         st_enc[tile_index] = 0;
 251                         tile_index++;
 252                         break;
 253                 }
 254         }
 255         /* some testing...
 256         xy_bddvar_map *map = NULL;
 257         map = create_xy_bddvar_map(screen);
 258         xy_bddvar_map *m = getxy(1, 1, map);
 259         bddvar_xy_map *map2 = NULL;
 260         map2 = create_bddvar_xy_map(screen);
 261         bddvar_xy_map *m2 = getbdd(2, map2);
 262         printf("Test1: %d %d\n", m->value.var[0], m->value.var[1]);
 263         printf("Test2: %d %d\n", m2->value.x, m2->value.y);
 264         */
 265         /* some more testing...
 266         bimap *bm = NULL;
 267         bm = create_bimap_helper(screen);
 268         xy_bddvar_map *m = getxy(1, 1, bm->f);
 269         bddvar_xy_map *m2 = getbdd(2, bm->t);
 270         printf("Test1: %d %d\n", m->value.var[0], m->value.var[1]);
 271         printf("Test2: %d %d\n", m2->value.x, m2->value.y);
 272         printf("%d tiles were encoded\n", tile_index);
 273         if (bm != NULL) printf ("WORKS!\n");
 274         */
 275         s = sylvan_cube(varset, st_enc);
 276         fullState->bdd = s;
 277         printf("Initial state encoded\n");
 278         return fullState;
 279 }
 280
 281 BDD encode_rel(sokoban_screen *screen)
 282 {
 283         int num_tiles;
 284         num_tiles = HASH_COUNT(screen);
 285         printf("Number of tiles: %d\n", num_tiles);
 286
 287         //left relation
 288
 289         //up relation
 290
 291         //right relation
 292
 293         //down relation
 294
 295         return sylvan_true;
 296 }