Rise of the metaverse's immersive virtual reality malware and the man-in-the-room attack & defenses
The allure of the metaverse along with Virtual Reality (VR) technologies and speed at which
they are deployed may shift focus away from security and privacy fundamentals. In this work …
they are deployed may shift focus away from security and privacy fundamentals. In this work …
Depth-first proof-number search with heuristic edge cost and application to chemical synthesis planning
A Kishimoto, B Buesser, B Chen… - Advances in Neural …, 2019 - proceedings.neurips.cc
Search techniques, such as Monte Carlo Tree Search (MCTS) and Proof-Number Search
(PNS), are effective in playing and solving games. However, the understanding of their …
(PNS), are effective in playing and solving games. However, the understanding of their …
Scalable parallel DFPN search
J Pawlewicz, RB Hayward - International Conference on Computers and …, 2013 - Springer
Abstract We present Scalable Parallel Depth-First Proof Number Search, a new shared-
memory parallel version of depth-first proof number search. Based on the serial DFPN 1+ ε …
memory parallel version of depth-first proof number search. Based on the serial DFPN 1+ ε …
Structured best arm identification with fixed confidence
R Huang, MM Ajallooeian… - International …, 2017 - proceedings.mlr.press
We study the problem of identifying the best action among a set of possible options when the
value of each action is given by a mapping from a number of noisy micro-observables in the …
value of each action is given by a mapping from a number of noisy micro-observables in the …
Othello is solved
H Takizawa - arXiv preprint arXiv:2310.19387, 2023 - arxiv.org
The game of Othello is one of the world's most complex and popular games that has yet to
be computationally solved. Othello has roughly ten octodecillion (10 to the 58th power) …
be computationally solved. Othello has roughly ten octodecillion (10 to the 58th power) …
[PDF][PDF] Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis.
Abstract We revisit Depth-First Proof-Number Search (DFPN), a well-known algorithm for
solving twoplayer games. First, we consider the completeness property of the algorithm and …
solving twoplayer games. First, we consider the completeness property of the algorithm and …
Strongly solved Ostle: calculating a strong solution helps compose high-quality puzzles for recent games
H Takizawa - PeerJ Computer Science, 2023 - peerj.com
Pure strategy board games such as chess are popular intellectual activities, and solving
them is a challenging task in computer science. In addition to traditional games, many new …
them is a challenging task in computer science. In addition to traditional games, many new …
Proof Number Based Monte-Carlo Tree Search
J Kowalski, E Doe, MHM Winands… - IEEE Transactions …, 2024 - ieeexplore.ieee.org
This paper proposes a new game-search algorithm, PN-MCTS, which combines Monte-
Carlo Tree Search (MCTS) and Proof-Number Search (PNS). These two algorithms have …
Carlo Tree Search (MCTS) and Proof-Number Search (PNS). These two algorithms have …
Proposal and generation of endgame puzzles for an imperfect information game Geister
Geister is a two-player imperfect information game played with two kinds of pieces, blue and
red, where each player cannot observe the colors of the opponent's pieces on the board. In …
red, where each player cannot observe the colors of the opponent's pieces on the board. In …
[PDF][PDF] Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex.
Proof Number search (PNS) is an effective algorithm for searching theoretical values on
games with non-uniform branching factors. Focused depth-first proof number search …
games with non-uniform branching factors. Focused depth-first proof number search …