Skip to content

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.

License

Notifications You must be signed in to change notification settings

PetePrattis/chromosome-last-random-nucleotide-game

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.

  1. 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

About

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.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages