https://github.com/peteprattis/chromosome-last-random-nucleotide-game

A Python script that implements a two player strategic game with two sequences of length n and m nucleotides respectively. At each Round of the game a player can remove a random number of nucleotides from one sequence or the same number of nucleotides from both sequences. The player who removes the last nucleotide wins.
https://github.com/peteprattis/chromosome-last-random-nucleotide-game

arrays bioinformatics chromosomes computer-science fasta game loop nucleotides program python student

Last synced: about 17 hours ago
JSON representation

A Python script that implements a two player strategic game with two sequences of length n and m nucleotides respectively. At each Round of the game a player can remove a random number of nucleotides from one sequence or the same number of nucleotides from both sequences. The player who removes the last nucleotide wins.

• Host: GitHub
• URL: https://github.com/peteprattis/chromosome-last-random-nucleotide-game
• Owner: PetePrattis
• License: mit
• Created: 2019-11-22T12:41:45.000Z (almost 5 years ago)
• Default Branch: master
• Last Pushed: 2019-11-22T13:56:58.000Z (almost 5 years ago)
• Last Synced: 2023-09-14T10:17:23.858Z (about 1 year ago)
• Topics: arrays, bioinformatics, chromosomes, computer-science, fasta, game, loop, nucleotides, program, python, student
• Language: Python
• Size: 41 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# A Python Program / Project

**This is a Python project from my early days as a Computer Science student**

_This programm was created for the sixth semester class Bioinformatics

and is one of the final projects for the class_

> #### Description of project

>

>>A Python script that implements a two player strategic game with two sequences of length n and m nucleotides respectively. At each Round of the game a player can remove a random number of nucleotides from one sequence or the same number of nucleotides from both sequences. The player who removes the last nucleotide wins.

> #### Strategy explanation

>

>A player, in order to be able to win the game described in this exercise, must find himself in 2 cases:

> 1. Case 1

>>Equal length on both chromosomes.

> 2. Case 2

>>At least one chromosome shall have a length of 0. 


>

>Therefore, every time we play, we try to find ourselves in the above situations in order to defeat our opponent. 

> #### About this project

>

> - The comments to make the code understandable, are within the .py archive

> - This project was written in IDLE, Python’s Integrated Development and Learning Environment.

> - Biological data used from https://www.ncbi.nlm.nih.gov/gene/ (genes 5836, 5834)

> - This program runs for Python version 2.7

> - This repository was created to show the variety of the work I did and experience I gained as a student

>