HEX and Neurodynamic Programming

by   Debangshu Banerjee, et al.

Hex is a complex game with a high branching factor. For the first time Hex is being attempted to be solved without the use of game tree structures and associated methods of pruning. We also are abstaining from any heuristic information about Virtual Connections or Semi Virtual Connections which were previously used in all previous known computer versions of the game. The H-search algorithm which was the basis of finding such connections and had been used with success in previous Hex playing agents has been forgone. Instead what we use is reinforcement learning through self play and approximations through neural networks to by pass the problem of high branching factor and maintaining large tables for state-action evaluations. Our code is based primarily on NeuroHex. The inspiration is drawn from the recent success of AlphaGo Zero.


page 1

page 2

page 3

page 4


Learning to Play Two-Player Perfect-Information Games without Knowledge

In this paper, several techniques for learning game state evaluation fun...

Supervised and Reinforcement Learning from Observations in Reconnaissance Blind Chess

In this work, we adapt a training approach inspired by the original Alph...

Dynamic Move Chains -- a Forward Pruning Approach to Tree Search in Computer Chess

This paper proposes a new mechanism for pruning a search game-tree in co...

KnightCap: A chess program that learns by combining TD(lambda) with game-tree search

In this paper we present TDLeaf(lambda), a variation on the TD(lambda) a...

Playing 2048 With Reinforcement Learning

The game of 2048 is a highly addictive game. It is easy to learn the gam...

Scalable Online Planning via Reinforcement Learning Fine-Tuning

Lookahead search has been a critical component of recent AI successes, s...

A New Challenge: Approaching Tetris Link with AI

Decades of research have been invested in making computer programs for p...

Please sign up or login with your details

Forgot password? Click here to reset