Repository logo
 
No Thumbnail Available
Publication

A recursive process related to a partisan variation of Wythoff

Use this identifier to reference this record.

Advisor(s)

Abstract(s)

Wythoff Queens is a classical combinatorial game related to very interesting mathematical results. An amazing one is the fact that the P-positions are given by (⌊├ φn⌋┤┤,├ ├ ⌊φ┤^2 n⌋) and (⌊├ φ^2 n⌋┤┤,├ ├ ⌊φ┤n⌋) where φ=(1+√5)/2. In this paper, we analyze a different version where one player (Left) plays with a chess bishop and the other (Right) plays with a chess knight. The new game (call it Chessfights) lacks a Beatty sequence structure in the P-positions as in Wythoff Queens. However, it is possible to formulate and prove some general results of a general recursive law which is a particular case of a Partizan Subtraction game.

Description

Keywords

Combinatorial Game Theory Partizan Subtraction Games Wythoff Queens

Citation

CARVALHO, A.; [et al] – A recursive process related to a partisan variation of Wythoff. Integers, Electronic Journal of Combinatorial Number Theory. ISSN: 1553-1732. Vol. 12, nr. 5 (2012)

Research Projects

Organizational Units

Journal Issue

Publisher

CC License

Altmetrics