Requirements of pair programming

简介:
题目:围棋棋谱的特征搜索
说明:
  1. 将用户的棋盘输入作为特征,在棋谱包中读取SGF棋谱,找出特征相符的棋谱。注:不仅要考虑棋子的位置,还要考虑走棋的顺序。
  2. 对找出的棋谱按照符合程度排序。
  3. 实现为桌面程序,实现技术不限。
  4. 此次作业采用pair programming的形式完成。提交作业后,在博客上发表日志贴上编程时的工作照。

以下是一个例子,
用户的棋盘输入如下:

 
程序将会找到如下特征相符的棋谱:
    
 
关于更多的围棋规则,与棋谱特征搜索的例子,可以参考这个网站: http://www.weiqiok.com/asp/Chinese.asp
   下面给出一个更加常见的例子,大家可以作为利用这个例子对自己的程序自我测试。
         






本文转自SoftwareTeacher博客园博客,原文链接:http://www.cnblogs.com/xinz/archive/2010/05/23/1881114.html,如需转载请自行联系原作者
目录
相关文章
|
10月前
|
设计模式 分布式计算 Kubernetes
译|Design patterns for container-based distributed systems(上)
译|Design patterns for container-based distributed systems
48 0
|
10月前
|
设计模式 缓存 监控
译|Design patterns for container-based distributed systems(下)
译|Design patterns for container-based distributed systems(下)
41 0
|
算法 Java BI
【论文阅读】(2013)A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
【论文阅读】(2013)A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
126 0
【论文阅读】(2013)A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
|
算法 数据挖掘 开发者
basic concept| 学习笔记
快速学习 basic concept。
62 0
basic concept| 学习笔记
成功解决The following specifications were found to be incompatible with the existing python installation
成功解决The following specifications were found to be incompatible with the existing python installation
|
机器学习/深度学习 算法
Data Structures and Algorithms (English) - 7-28 Review of Programming Contest Rules(30 分)
Data Structures and Algorithms (English) - 7-28 Review of Programming Contest Rules(30 分)
176 0
Data Structures and Algorithms (English) - 7-28 Review of Programming Contest Rules(30 分)
Basic Concepts of Genetic Data Analysis
Basic Concepts of Genetic Data Analysis
879 0