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