English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

Given a combinatorial game, is there guaranteed to be a Blue-Red-Green Hackenbush game, finite or infinite, that's equivalent to it?

2007-01-30 11:51:15 · 3 answers · asked by Steven F 2 in Science & Mathematics Mathematics

3 answers

Hmm. I think so.

Not a great answer, but "Winning Ways" is a hard book to look something up in.

For the previous answerer, this is combinatorial game theory. Best references are "On Numbers and Games" by Conway and the "Winning Ways" by Berlekamp, Conway and Somebodyerother.

I do know that all finite impartial games are equivalent to a single pile game of nim.

I think you can prove it simply for finite games, but as I think about it I am getting lost.

Sorry

2007-01-30 12:32:29 · answer #1 · answered by hadrian2 2 · 0 0

I think that we used some other games to find different values that you could not find in hackenbush. For example, I don't remember the value star poping up in hackenbush. It did pop up in the map coloring game. Also, we did not see the values up, down, or switches in the game Hackenbush.

2007-01-30 22:48:23 · answer #2 · answered by raz 5 · 0 0

Dude, what kind of Math is that.

2007-01-30 20:03:42 · answer #3 · answered by Anonymous · 0 2

fedest.com, questions and answers