blooz
Advanced Member level 2
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 ?
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 ?