Magazine et Edition

Volume 10 (2023): Edition 17 (January 2023)

Volume 9 (2022): Edition 16 (June 2022)

Volume 8 (2021): Edition 15 (November 2021)

Volume 8 (2021): Edition 14 (October 2021)

Volume 7 (2020): Edition 13 (November 2020)

Volume 6 (2019): Edition 12 (December 2019)

Volume 6 (2019): Edition 11 (September 2019)

Volume 5 (2018): Edition 10 (December 2018)

Volume 5 (2018): Edition 9 (September 2018)

Volume 4 (2017): Edition 8 (December 2017)

Volume 4 (2017): Edition 7 (May 2017)

Volume 3 (2016): Edition 6 (December 2016)

Volume 3 (2016): Edition 5 (March 2016)

Détails du magazine
Format
Magazine
eISSN
2182-1976
Première publication
16 Apr 2016
Période de publication
2 fois par an
Langues
Anglais

Chercher

Volume 8 (2021): Edition 15 (November 2021)

Détails du magazine
Format
Magazine
eISSN
2182-1976
Première publication
16 Apr 2016
Période de publication
2 fois par an
Langues
Anglais

Chercher

4 Articles
Accès libre

Bishop Independence on the Surface of a Square Prism

Publié en ligne: 07 Dec 2021
Pages: 1 - 12

Résumé

Abstract

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.

MSC 2010

  • 05C69
  • 00A08
Accès libre

Diameter-Separation of Chessboard Graphs

Publié en ligne: 07 Dec 2021
Pages: 13 - 26

Résumé

Abstract

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.

Accès libre

Adjustable Coins

Publié en ligne: 07 Dec 2021
Pages: 27 - 39

Résumé

Abstract

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.

Accès libre

Who is Guilty?

Publié en ligne: 07 Dec 2021
Pages: 41 - 52

Résumé

Abstract

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?”

4 Articles
Accès libre

Bishop Independence on the Surface of a Square Prism

Publié en ligne: 07 Dec 2021
Pages: 1 - 12

Résumé

Abstract

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.

MSC 2010

  • 05C69
  • 00A08
Accès libre

Diameter-Separation of Chessboard Graphs

Publié en ligne: 07 Dec 2021
Pages: 13 - 26

Résumé

Abstract

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.

Accès libre

Adjustable Coins

Publié en ligne: 07 Dec 2021
Pages: 27 - 39

Résumé

Abstract

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.

Accès libre

Who is Guilty?

Publié en ligne: 07 Dec 2021
Pages: 41 - 52

Résumé

Abstract

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?”

Planifiez votre conférence à distance avec Sciendo