Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

How to Model a problem using Genetic algorithm ?

Status
Not open for further replies.

blooz

Advanced Member level 2
Joined
Dec 29, 2010
Messages
561
Helped
121
Reputation
242
Reaction score
116
Trophy points
1,343
Location
India
Activity points
4,985
Hi
Particular Problem

{ slight variation of Taxman/Numbershark number game}
{a sort of game between two . A and B}



Rules

are

1.Initially a Stack of numbers is chosen.Eg up to N=50

2.Turn based game

3.First A choose a particular number and B gets all it's factors Eg A chooses 40 .it means B gets
1,2,4,5,8 and 20

and scores

A-40
B-1+2+4+5+8+20 ,ie the sum of factors

once a number is chosen either by A or B that number will be removed from the stack

3.b If there are no factors left then opponent gets that number .


4.Aim of both players is to maximize their sum


5.How to find the optimal sum and sequence ?

can we use genetic algorithm to solve this kind of problem ?
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Top