找回密码
 立即注册
搜索
总共850条微博

动态微博

查看: 2445|回复: 1
打印 上一主题 下一主题
收起左侧

IBM挑战2005年1月:七色珠链

[复制链接]

15

主题

42

帖子

807

积分

跳转到指定楼层
楼主
发表于 2005-2-27 13:04:54 | 只看该作者 回帖奖励 |正序浏览 |阅读模式


IBM挑战2005年1月:七色珠链



一条闭串项链由35颗珠子组成,珠子的颜色共分7种。从7种颜色中选3种共有35种不同组合。请找出一种珠子安排,令这35种不同颜色组合在项链的每3颗相连珠子中恰好出现1次。


英文原文



Ponder This Challenge:

Puzzle for January 2005


Our New Years puzzle was submitted by John G. Fletcher,

who heard it from Marc Roth.

www.ddhw.com

A necklace is made up of 35 beads forming a closed loop, each bead being of one of 7 distinct colors. Find an arrangement for the beads such that every one of the 35 combinations of the 7 colors taken 3 at a time occurs exactly once as a set of 3 consecutive beads.


The first 100 people who answer correctly will be listed. The answer will be posted a week after the 100th is received, or at the end of the month.

www.ddhw.com

 
回复

使用道具 举报

0

主题

2

帖子

12

积分

沙发
发表于 2005-3-1 01:14:07 | 只看该作者

Just had a look at the IBM page


This problem is not easy, as there is no general rule to solve it. Some people who successfully solved the problem used computer. www.ddhw.com
 
I was wondering whether any algorithm for Halmiton cycles can help. --This problem can be viewed as a variant of /halmiton cycle, I think.
www.ddhw.com

 
回复 支持 反对

使用道具 举报

24小时热帖
    一周热门
      原创摄影
        美食美文
          您需要登录后才可以回帖 登录 | 立即注册

          本版积分规则

          Archiver|手机版|珍珠湾ART

          Powered by Discuz! X3 © 2001-2013 All Rights Reserved