The purpose of reinforcement learning is to maximize rewards from environment, and reinforcement learning agents learn by interacting with external environment through trial and error. Q-Learning, a representative reinforcement learning algorithm, is a type of TD-learning that exploits difference in suitability according to the change of time in learning. The method obtains the optimal policy t...

Given an n×n chess board, a queen graph is a graph with n vertices, each corresponding to a square of the board. Two vertices are connected by an edge if the corresponding squares are in the same row, column, or diagonals (both ascending and descending diagonals), this corresponds to the queen move rule at the chess game. The coloring problem on this graph consists in finding the minimum number...

This paper presents a technique of staganography where hiding of secret image done by LSB substitution and N-Queen matrix act as key. Key used to indicate pixel position of Cover image where substitution will take place.Memomy complex (Memory strand and DNA stickers) used to represent N-Queen matrix so that key isn’t understandable to unauthorized user. Size of NQueen matrix relate with no. of ...

Placing n mutually non-attacking queens on an n by n chessboard is a classical problem in the artificial intelligence (AI) area. Over the past few decades, this problem has become important to computer scientists for providing solutions to many useful and practical applications. In this paper, we present a novel approach to solving the n-queens problem in a considerably less execution time. The...

We examined changes in the content of biogenic amines in the brains of ant queen associated with early colony establishment. In ants, including Formica japonica, winged virgin queens lose their wings following copulation, and then start establishing a colony. Significant changes in brain biogenic amine content in the queen are associated with transition from winged virgin queen to wingless mate...

This paper investigates the cost of finding the first solution to the N-Queens Problem using various backtrack search strategies. Among the empirical results obtained are the following: 1) To find the first solution to the N-Queens Problem using lexicographic backtracking requires a time that grows exponentially with increasing values of N. 2) For most even values of N e 30, search time can be ...

In Martin Gardner’s October 1976 Mathematical Games column in Scientific American, he posed the following problem: “What is the smallest number of [queens] you can put on an [n× n chessboard] such that no [queen] can be added without creating three in a row, a column, or a diagonal?” We use the Combinatorial Nullstellensatz to prove that this number is at least n. A second, more elementary proo...