Search

The $\beta$ decay of one-neutron halo nucleus $^{11}$Be was investigated using the Warsaw Optical Time Projection Chamber (OTPC) detector to measure $\beta$-delayed charged particles. The results of two experiments are reported. In the first one, carried out in LNS Catania, the absolute branching ratio for $\beta$-delayed $\alpha$ emission was measured by counting incoming $^{11}$Be ions stopped in the detector and the observed decays with the emission of $\alpha$ particle. The result of 3.27(46)\% is in good agreement with the literature value. In the second experiment, performed at the HIE-ISOLDE facility at CERN, bunches containing several hundreds of $^{11}$Be ions were implanted into the OTPC detector followed by the detection of decays with the emission of charged particles. The energy spectrum of $\beta$-delayed $\alpha$ particles was determined in the full energy range. It was analysed in the R-matrix framework and was found to be consistent with the literature. The best description of the spectrum was obtained assuming that the two $3/2^+$ and one $1/2^+$ states in $^{11}$B are involved in the transition. The search for $\beta$-delayed emission of protons was undertaken. Only the upper limit for the branching ratio for this process of $(2.2 \pm 0.6_{\rm stat} \pm 0.6_{\rm sys}) \times 10^{-6}$ could be determined. This value is in conflict with the result published in [Ayyad et al. Phys. Rev. Lett. 123, 082501 (2019)] but does agree with the limit reported in [Riisager et al., Eur. Phys. J. A (2020) 56:100], Comment: 16 pages, 18 figures, submitted to Phys. Rev. C

Background: Asymmetric fission is known to occur in two regions, the actinides and sub-lead, and is dependent on the fissioning system excitation energy. Experimental evidence in the sub-lead region show that this mode is surprisingly persistent with increasing energy and its origin is not fully understood. Purpose: To experimentally study the fusion-fission reaction of $^{215}$Fr at moderate excitation energy and determine previously unknown independent fission yields and other properties. Method: The compound nucleus was formed in the reaction $^{18}$O + $^{197}$Au. The prompt gamma-rays emitted during the reaction were measured with the high efficiency and high granularity $\nu$-ball2 spectrometer. Independent fission yields of even-even nuclei were determined by detecting triple-gamma cascades in the fission fragments. Results: The observed yields, although dominated by a symmetric peak, show maxima for heavy fragment of $Z \approx 54-56$, which is consistent with the known results in the actinide region but unexpected for the nuclide of interest, and at the studied excitation energy. Conclusions: The mode of asymmetric fission is present even at relatively high excitation energies in the system studied. This observation matches experimental findings in the sub-lead region, contrary to the actinides, and so far there is no well-developed explanation of this phenomenon.

This paper concludes five years of AI competitions based on Legends of Code and Magic (LOCM), a small Collectible Card Game (CCG), designed with the goal of supporting research and algorithm development. The game was used in a number of events, including Community Contests on the CodinGame platform, and Strategy Card Game AI Competition at the IEEE Congress on Evolutionary Computation and IEEE Conference on Games. LOCM has been used in a number of publications related to areas such as game tree search algorithms, neural networks, evaluation functions, and CCG deckbuilding. We present the rules of the game, the history of organized competitions, and a listing of the participant and their approaches, as well as some general advice on organizing AI competitions for the research community. Although the COG 2022 edition was announced to be the last one, the game remains available and can be played using an online leaderboard arena., Comment: IEEE Conference on Games 2023

This paper presents a new AI challenge, the Tales of Tribute AI Competition (TOTAIC), based on a two-player deck-building card game released with the High Isle chapter of The Elder Scrolls Online. Currently, there is no other AI competition covering Collectible Card Games (CCG) genre, and there has never been one that targets a deck-building game. Thus, apart from usual CCG-related obstacles to overcome, like randomness, hidden information, and large branching factor, the successful approach additionally requires long-term planning and versatility. The game can be tackled with multiple approaches, including classic adversarial search, single-player planning, and Neural Networks-based algorithms. This paper introduces the competition framework, describes the rules of the game, and presents the results of a tournament between sample AI agents., Comment: Extended version of IEEE Conference on Games 2024 paper

In this paper, we study AI approaches to successfully play a 2-4 players, full information, Bomberman variant published on the CodinGame platform. We compare the behavior of three search algorithms: Monte Carlo Tree Search, Rolling Horizon Evolution, and Beam Search. We present various enhancements leading to improve the agents' strength that concern search, opponent prediction, game state evaluation, and game engine encoding. Our top agent variant is based on a Beam Search with low-level bit-based state representation and evaluation function heavy relying on pruning unpromising states based on simulation-based estimation of survival. It reached the top one position among the 2,300 AI agents submitted on the CodinGame arena., Comment: International Conference on Agents and Artificial Intelligence 2022

In this work, we presented a study regarding two important aspects of evolving feature-based game evaluation functions: the choice of genome representation and the choice of opponent used to test the model. We compared three representations. One simpler and more limited, based on a vector of weights that are used in a linear combination of predefined game features. And two more complex, based on binary and n-ary trees. On top of this test, we also investigated the influence of fitness defined as a simulation-based function that: plays against a fixed weak opponent, plays against a fixed strong opponent, and plays against the best individual from the previous population. For a testbed, we have chosen a recently popular domain of digital collectible card games. We encoded our experiments in a programming game, Legends of Code and Magic, used in Strategy Card Game AI Competition. However, as the problems stated are of general nature we are convinced that our observations are applicable in the other domains as well.

The structure of the doubly magic $^{132}_{50}$Sn$_{82}$ has been investigated at the ISOLDE facility at CERN, populated both by the $\beta^-$decay of $^{132}$In and $\beta^-$-delayed neutron emission of $^{133}$In. The level scheme of $^{132}$Sn is greatly expanded with the addition of 68 $\gamma$-transitions and 17 levels observed for the first time in the $\beta$ decay. The information on the excited structure is completed by new $\gamma$-transitions and states populated in the $\beta$-n decay of $^{133}$In. Improved delayed neutron emission probabilities are obtained both for $^{132}$In and $^{133}$In. Level lifetimes are measured via the Advanced Time-Delayed $\beta\gamma\gamma$(t) fast-timing method. An interpretation of the level structure is given based on the experimental findings and the particle-hole configurations arising from core excitations both from the \textit{N} = 82 and \textit{Z} = 50 shells, leading to positive and negative parity particle-hole multiplets. The experimental information provides new data to challenge the theoretical description of $^{132}$Sn., Comment: 19 pages, 11 figures. Accepted for publication in Phys. Rev. C

We present the technical side of reasoning in Regular Boardgames (RBG) language -- a universal General Game Playing (GGP) formalism for the class of finite deterministic games with perfect information, encoding rules in the form of regular expressions. RBG serves as a research tool that aims to aid in the development of generalized algorithms for knowledge inference, analysis, generation, learning, and playing games. In all these tasks, both generality and efficiency are important. In the first part, this paper describes optimizations used by the RBG compiler. The impact of these optimizations ranges from 1.7 to even 33-fold efficiency improvement when measuring the number of possible game playouts per second. Then, we perform an in-depth efficiency comparison with three other modern GGP systems (GDL, Ludii, Ai Ai). We also include our own highly optimized game-specific reasoners to provide a point of reference of the maximum speed. Our experiments show that RBG is currently the fastest among the abstract general game playing languages, and its efficiency can be competitive to common interface-based systems that rely on handcrafted game-specific implementations. Finally, we discuss some issues and methodology of computing benchmarks like this., Comment: IEEE Conference on Games 2020

In this paper, we evolve a card-choice strategy for the arena mode of Legends of Code and Magic, a programming game inspired by popular collectible card games like Hearthstone or TES: Legends. In the arena game mode, before each match, a player has to construct his deck choosing cards one by one from the previously unknown options. Such a scenario is difficult from the optimization point of view, as not only the fitness function is non-deterministic, but its value, even for a given problem instance, is impossible to be calculated directly and can only be estimated with simulation-based approaches. We propose a variant of the evolutionary algorithm that uses a concept of an active gene to reduce the range of the operators only to generation-specific subsequences of the genotype. Thus, we batched learning process and constrained evolutionary updates only to the cards relevant for the particular draft, without forgetting the knowledge from the previous tests. We developed and tested various implementations of this idea, investigating their performance by taking into account the computational cost of each variant. Performed experiments show that some of the introduced active-genes algorithms tend to learn faster and produce statistically better draft policies than the compared methods., Comment: Accepted to IEEE Congress on Evolutionary Computation 2020

The gas depletion factor $\gamma(z)$, i.e., the average ratio of the gas mass fraction to the cosmic mean baryon fraction of galaxy clusters, plays a very important role in the cosmological application of the gas mass fraction measurements. In this paper, using the newest catalog of 182 galaxy clusters detected by the Atacama Cosmology Telescope (ACT) Polarization experiment, we investigate the possible redshift evolution of $\gamma(z)$ through a new cosmology-independent method. The method is based on non-parametric reconstruction using the measurements of Hubble parameters from cosmic chronometers. Unlike hydrodynamical simulations suggesting constant depletion factor, our results reveal the trend of $\gamma(z)$ decreasing with redshift. This result is supported by a parametric model fit as well as by calculations on the reduced ACTPol sample and on the alternative sample of 91 SZ clusters reported earlier in ACT compilation. Discussion of possible systematic effects leaves an open question about validity of the empirical relation $M_{tot}$-$f_{gas}$ obtained on very close clusters. These results might pave the way to explore the hot gas fraction within large radii of galaxy clusters as well as its possible evolution with redshift, which should be studied further on larger galaxy cluster samples in the upcoming X-ray/SZ cluster surveys., Comment: 9 pages, 6 figures, 1 table. Comments welcome