|
1. |
pretorik |
- |
161 |
2. |
markr |
- |
116 |
3. |
Gordon Weir |
- |
104 |
4. |
mbloomfi |
- |
97 |
5. |
Dennis Nazarov |
- |
96 |
6. |
zzz123 |
- |
72 |
7. |
Srikanta |
- |
56 |
8. |
lidSpelunker |
- |
53 |
9. |
SAMIH FAHMY |
- |
48 |
10. |
jkr |
- |
44 |
|
|
|
|
1. |
denisR, mishik |
- |
236 |
2. |
alan, De_Bill |
- |
231 |
3. |
dddfff |
- |
228 |
4. |
kavfy |
- |
221 |
5. |
idler_ |
- |
106 |
6. |
akajobe |
- |
94 |
7. |
tolstyi |
- |
56 |
8. |
STARuK |
- |
42 |
9. |
vale |
- |
31 |
10. |
xandr |
- |
11 |
|
|
|
|
Caesar and Brutus |
Games puzzles |
|
Weight: 5 |
|
Liked the puzzle: 100% |
|
26.12.2009 |
|
Two commanders (Caesar and Brutus) conquer a country which forms a connected graph with nodes representing cities and edges representing roads. First, Caesar chooses a city and claims it. Then, Brutus claims any of the remaining cities. Turn by turn, the commanders claim the available cities that are adjacent to the cities they have already claimed. If a commander cannot make a claim, he skips a move. The game continues until all cities have been claimed. Both commanders wish to claim a maximal number of cities. Can Brutus win in this game? |
|
|
|
Please do not post comments containing clues, hints, or anything that might be considered as a hint to others. All such comments will be deleted. If you have a question, you can contact a moderator by clicking the button "Submit your solution".
|
alan |
|
Rating: 231
Group: Moderators
|
|
|
|
pretorik |
|
Rating: 161
Group: Members
|
|
|
|
alan |
|
Rating: 231
Group: Moderators
|
|
|
|
zzz123 |
|
Rating: 72
Group: Members
|
|
|
|
alan |
|
Rating: 231
Group: Moderators
|
|
|
|
|
|
|