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 int check_xy_exists(int x, int y, bimap *bm)
 161 {
 162         int res = 0;
 163         if (getxy(x, y, bm->f) != NULL) res = 1;
 164         return res;
 165 }
 166
 167 /*
 168  * Each coordinate has three related boolean variables. The combination of those boolean variables
 169  * defines tiles:
 170  * 000: Wall
 171  * 001: Free
 172  * 010: Box
 173  * 100: Box on target
 174  * 011: Target
 175  * 101: Agent
 176  * 110: Agent on target
 177  * In the BDD representation, the state is represented by n * 3 variables, where n is the number of
 178  * tiles in the shrinked screen.
 179  * It seems that the move variable is not necessary since non-deterministic moves can be emvedded
 180  * directly in transition relations.
 181  */
 182
 183 state *encode_screen(sokoban_screen *screen)
 184 {
 185         LACE_ME;
 186
 187         BDDVAR vars[HASH_COUNT(screen) * 3];
 188         for (uint8_t i = 0; i < HASH_COUNT(screen) * 3; i++){
 189                 vars[i] = i;
 190         }
 191
 192         uint8_t st_enc[HASH_COUNT(screen) * 3];
 193
 194         BDDSET varset = sylvan_set_fromarray(vars, HASH_COUNT(screen) * 3);
 195         BDD s;
 196         state *fullState = NULL;
 197         fullState = (state *)malloc(sizeof(state));
 198         fullState->vars.varset = varset;
 199         fullState->vars.size = HASH_COUNT(screen) * 3;
 200         int tile_index = 0;
 201         sokoban_screen *r;
 202         for(r=screen; r != NULL; r = (sokoban_screen *)(r->hh.next)){
 203                 switch(r->tile){
 204                 case FREE: //001
 205                         st_enc[tile_index] = 0;
 206                         tile_index++;
 207                         st_enc[tile_index] = 0;
 208                         tile_index++;
 209                         st_enc[tile_index] = 1;
 210                         tile_index++;
 211                         break;
 212                 case WALL: //000
 213                         st_enc[tile_index] = 0;
 214                         tile_index++;
 215                         st_enc[tile_index] = 0;
 216                         tile_index++;
 217                         st_enc[tile_index] = 0;
 218                         tile_index++;
 219                         break;
 220                 case BOX: //010
 221                         st_enc[tile_index] = 0;
 222                         tile_index++;
 223                         st_enc[tile_index] = 1;
 224                         tile_index++;
 225                         st_enc[tile_index] = 0;
 226                         tile_index++;
 227                         break;
 228                 case TARGET: //011
 229                         st_enc[tile_index] = 0;
 230                         tile_index++;
 231                         st_enc[tile_index] = 1;
 232                         tile_index++;
 233                         st_enc[tile_index] = 1;
 234                         tile_index++;
 235                         break;
 236                 case AGENT: //101
 237                         st_enc[tile_index] = 1;
 238                         tile_index++;
 239                         st_enc[tile_index] = 0;
 240                         tile_index++;
 241                         st_enc[tile_index] = 1;
 242                         tile_index++;
 243                         break;
 244                 case TARGAGENT: //110
 245                         st_enc[tile_index] = 1;
 246                         tile_index++;
 247                         st_enc[tile_index] = 1;
 248                         tile_index++;
 249                         st_enc[tile_index] = 0;
 250                         tile_index++;
 251                         break;
 252                 case TARGBOX: //100
 253                         st_enc[tile_index] = 1;
 254                         tile_index++;
 255                         st_enc[tile_index] = 0;
 256                         tile_index++;
 257                         st_enc[tile_index] = 0;
 258                         tile_index++;
 259                         break;
 260                 }
 261         }
 262         /* some testing...
 263         xy_bddvar_map *map = NULL;
 264         map = create_xy_bddvar_map(screen);
 265         xy_bddvar_map *m = getxy(1, 1, map);
 266         bddvar_xy_map *map2 = NULL;
 267         map2 = create_bddvar_xy_map(screen);
 268         bddvar_xy_map *m2 = getbdd(2, map2);
 269         printf("Test1: %d %d\n", m->value.var[0], m->value.var[1]);
 270         printf("Test2: %d %d\n", m2->value.x, m2->value.y);
 271         */
 272         /* some more testing...
 273         bimap *bm = NULL;
 274         bm = create_bimap_helper(screen);
 275         xy_bddvar_map *m = getxy(1, 1, bm->f);
 276         bddvar_xy_map *m2 = getbdd(2, bm->t);
 277         printf("Test1: %d %d\n", m->value.var[0], m->value.var[1]);
 278         printf("Test2: %d %d\n", m2->value.x, m2->value.y);
 279         printf("%d tiles were encoded\n", tile_index);
 280         if (bm != NULL) printf ("WORKS!\n");
 281         */
 282         s = sylvan_cube(varset, st_enc);
 283         fullState->bdd = s;
 284         printf("Initial state encoded\n");
 285         return fullState;
 286 }
 287
 288 BDD encode_rel(sokoban_screen *screen)
 289 {
 290         int num_tiles;
 291         num_tiles = HASH_COUNT(screen);
 292         printf("Number of tiles: %d\n", num_tiles);
 293
 294         //left relation
 295
 296         //up relation
 297
 298         //right relation
 299
 300         //down relation
 301
 302         return sylvan_true;
 303 }