EUVIMEDEUVIMED entdecken
Crossref

Game of Moving (k,m)-Pieces where (k,m)∈{(1,2n+1),(2,2n+8),(3,4n+5),(3,4n+7)}

Ratinan Boonklurb, Rohana Samae, Pinkaew Siriwong

Journal of Science Ladkrabang · 2025

DOI: 10.55003/scikmitl.2025.265764 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Science Ladkrabang, 2025. Verfasst von Ratinan Boonklurb und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let m and k be positive integers such that m≥k. The game of moving (k,m)-pieces is a one-player game on a 1×m board involving two colors of pieces, with a total of m-k pieces. Each color has an equal number of pieces. At the beginning, we place all first color pieces from the rightmost to the leftmost followed by all second color pieces. The goal of this game is to move k consecutive pieces to the empty spaces on the board until the pieces are arranged in alternative colors placed from the leftmost position onward. In this study, for any positive integer n≥1, we obtain 1) when (k,m)=(1,2n+1), the minimum number of moving is 2n-2[n/2] 2) when (k,m)=(2,2n+8), the minimum number of moving is 2n+3 3) when (k,m)=(3,4n+5), the minimum number of moving is 4n-1 and 4) when (k,m)=(3,4n+7), the minimum number of moving is 4n+2.

Zitieren

APA

Boonklurb, R., Samae, R., & Siriwong, P. (2025). Game of Moving (k,m)-Pieces where (k,m)∈{(1,2n+1),(2,2n+8),(3,4n+5),(3,4n+7)}. Journal of Science Ladkrabang. https://doi.org/10.55003/scikmitl.2025.265764

Vancouver

Boonklurb R, Samae R, Siriwong P. Game of Moving (k,m)-Pieces where (k,m)∈{(1,2n+1),(2,2n+8),(3,4n+5),(3,4n+7)}. Journal of Science Ladkrabang. 2025. doi:10.55003/scikmitl.2025.265764

BibTeX
@article{Boonklurb2025,
  author = {Boonklurb, Ratinan and Samae, Rohana and Siriwong, Pinkaew},
  title = {Game of Moving (k,m)-Pieces where (k,m)∈(1,2n+1),(2,2n+8),(3,4n+5),(3,4n+7)},
  journal = {Journal of Science Ladkrabang},
  year = {2025},
  doi = {10.55003/scikmitl.2025.265764}
}
Kostenlos starten →