Heuristic Sensing: An Uncertainty Exploration Method in Imperfect Information Games

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td class="align_left">Game</td><td class="align_center">Game states</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td class="align_left">Heads-Up No-Limit</td><td class="align_center">1083</td></tr><tr><td class="align_left">Chess</td><td class="align_center">1</td></tr><tr><td class="align_left">RBC</td><td class="align_center"><span style="width: 50.9936ptpx;"><svg height="11.9413pt" id="M7" style="vertical-align:-0.3499002pt" version="1.1" viewbox="-0.0498162 -11.5914 50.9936 11.9413" width="50.9936pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g><g transform="matrix(.013,0,0,-0.013,6.24,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,9.204,0)"><path d="M285 378C315 398 338 416 353 432C373 451 384 474 384 503C384 579 325 635 236 635H235C182 635 136 610 108 579L65 516L85 496C110 533 150 575 205 575C258 575 300 543 300 481C300 407 232 369 141 339L147 310C163 315 188 321 211 321C268 321 338 284 338 192C338 94 288 40 217 40C160 40 119 68 93 91C85 98 77 97 69 91C60 84 47 71 46 58C44 46 48 35 62 22C75 10 116 -12 162 -12C234 -12 424 62 424 224C424 297 373 359 285 376V378Z"></path></g><g transform="matrix(.013,0,0,-0.013,18.35,0)"><path d="M528 54L331 254L528 455L492 493L294 291L96 493L60 455L257 254L60 54L96 16L294 217L492 16L528 54Z"></path></g><g transform="matrix(.013,0,0,-0.013,28.886,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g><g transform="matrix(.013,0,0,-0.013,35.126,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,41.413,-5.741)"><path d="M141 347C171 480 264 541 327 570C364 587 403 599 436 605L429 641C389 634 339 622 300 609C191 570 37 458 37 239C37 86 126 -12 245 -12C367 -12 454 89 454 210C454 314 380 397 272 397C252 397 230 390 208 380L141 347ZM231 338C323 338 366 257 366 174C366 108 340 27 263 27C180 27 129 123 129 244C129 268 130 292 135 310C158 323 193 338 231 338Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,45.845,-5.741)"><path d="M253 635C142 635 71 555 71 471C71 401 113 353 178 316C144 294 106 267 91 252C70 231 46 202 46 157C46 51 132 -12 241 -12C328 -12 442 52 442 168C442 257 379 305 311 343C354 373 380 398 388 407C406 428 417 458 417 487C417 568 348 635 253 635ZM240 600C288 600 340 563 340 481C340 423 313 387 279 360C207 394 148 427 148 499C148 549 182 600 240 600ZM252 23C188 23 129 73 129 163C129 217 162 266 211 298C289 260 360 217 360 144C360 69 312 23 252 23Z"></path></g></svg></span></td></tr><tr><td class="align_left">Six-Player-No-Limit</td><td class="align_center"><span style="width: 50.9936ptpx;"><svg height="11.9413pt" id="M8" style="vertical-align:-0.3499002pt" version="1.1" viewbox="-0.0498162 -11.5914 50.9936 11.9413" width="50.9936pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M137 343C167 482 260 545 321 574C357 591 397 603 429 609L423 641C382 634 335 622 295 608C189 570 37 457 37 238C37 84 125 -12 242 -12C362 -12 447 89 447 209C447 311 374 393 267 393C247 393 226 386 204 376L137 343ZM227 337C318 337 361 256 361 173C361 105 336 22 258 22C176 22 126 120 126 240C126 266 127 291 132 310C155 323 189 337 227 337Z"></path></g><g transform="matrix(.013,0,0,-0.013,6.24,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,9.204,0)"><path d="M456 178V225H360V632H320C217 496 115 347 20 206V178H280V106C280 40 276 34 189 27V0H445V27C364 34 360 39 360 106V178H456ZM280 225H82C149 335 214 431 278 520H280V225Z"></path></g><g transform="matrix(.013,0,0,-0.013,18.35,0)"><path d="M528 54L331 254L528 455L492 493L294 291L96 493L60 455L257 254L60 54L96 16L294 217L492 16L528 54Z"></path></g><g transform="matrix(.013,0,0,-0.013,28.886,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z"></path></g><g transform="matrix(.013,0,0,-0.013,35.126,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,41.413,-5.741)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,45.845,-5.741)"><path d="M462 177V227H365V632H320C217 496 116 350 21 208V177H284V109C284 43 280 38 190 31V0H451V31C369 38 365 43 365 108V177H462ZM284 227H88C155 336 218 430 282 519H284V227Z"></path></g></svg></span></td></tr><tr><td class="align_left">Go (19×19)</td><td class="align_center">1</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>Approximate means the number of possible opponents’ states in an information set.</div>

Complexity

tab2

Table 2

Table 2: Heuristic Sensing: An Uncertainty Exploration Method in Imperfect Information Games 