# Volume 8 (2021): Edizione 15 (November 2021)

Dettagli della rivista
Formato
Rivista
eISSN
2182-1976
Pubblicato per la prima volta
16 Apr 2016
Periodo di pubblicazione
2 volte all'anno
Lingue
Inglese

4 Articoli
Accesso libero

#### Bishop Independence on the Surface of a Square Prism

Pubblicato online: 07 Dec 2021
Pagine: 1 - 12

#### Astratto

Bishop Independence concerns determining the maximum number of bishops that can be placed on a board such that no bishop can attack any other bishop. This paper presents the solution to the bishop independence problem, determining the bishop independence number, for all sizes of boards on the surface of a square prism.

• 05C69
• 00A08
Accesso libero

#### Diameter-Separation of Chessboard Graphs

Pubblicato online: 07 Dec 2021
Pagine: 13 - 26

#### Astratto

We define the queens (resp., rooks) diameter-separation number to be the minimum number of pawns for which some placement of those pawns on an n × n board produces a board with a queens graph (resp., rooks graph) with a desired diameter d. We determine these numbers for some small values of d.

Accesso libero

Pubblicato online: 07 Dec 2021
Pagine: 27 - 39

#### Astratto

In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and there is also a penalty for failing to solve the problem. The user may run one algorithm at a time for the specified cost, or give up and pay the penalty. The probability of success may be implied by randomization in the algorithm, or by assuming a probability distribution on the input space, which lead to different variants of the problem. The goal is to minimize the expected cost of the process under the assumption that the algorithms are independent. We study several variants of this problem, and present possible solution strategies and a hardness result.

Accesso libero

#### Who is Guilty?

Pubblicato online: 07 Dec 2021
Pagine: 41 - 52

#### Astratto

We discuss a generalization of logic puzzles in which truth-tellers and liars are allowed to deviate from their pattern in case of one particular question: “Are you guilty?”