第五次作业对我个人来说是很难的,因为之前没怎么接触过这方面的内容,有幸能跟宗毅组成一队,我也仔细看了他的Python代码,因为对于Python也是第一次接触,所以我感觉在有限的时间里学会并且灵活运用还是很困难的,所以虽然付出了一些努力,还是一直处于学习的状态,没有得到想象中的结果,但是也理清了思路,实践了一些东西,还是很有收获,我相信通过我的努力一定会越来越好。下面附上代码和截图:

服务器程序:

# -*- coding: utf-8 -*-
import socket
import thread
import random
import hashlib
import urllib, urlparse
import time connLock = 0
def sendMsg(conn, msg):
global connLock
while connLock == 1:
continue
connLock = 1
conn.send(msg)
connLock = 0 class player():
username = ''
token = ''
point = 0
guess = 0
conn = None
timeoutCount = 0
def __init__(self, username, conn):
self.username = username
self.token = hashlib.md5(str(random.randint(1, 2**256))).hexdigest()
self.point = 0
self.timeoutCount = 0
self.conn = conn
def getToken(self):
return self.token
def win(self):
self.point = self.point + 10
def lose(self):
self.point = self.point - 5
def timeout(self):
self.point = self.point - 10
self.timeoutCount = self.timeoutCount + 1
def submit(self, guess):
self.guess = guess
def getGuess(self):
return self.guess
def getUsername(self):
return self.username
def getPoint(self):
return self.point
def newRound(self, timeout, count):
req = {
'cmd': 'newround',
'count': count,
'timeout': str(timeout),
'yourpoint': str(self.getPoint())
}
sendMsg(conn, urllib.urlencode(req)) class game():
roundTime = 30
lastWinner = ''
lastLosers = []
lastG = 0
players = []
waiting = 0
roundCount = 0
def __init__(self):
self.roundTime = 5
def newRound(self):
print 'users:'
for i in self.players:
print i.getUsername(), i.point
#compute G
self.waiting = 0
i = [i.getGuess() for i in self.players]
if len(i) != 0:
self.lastG = sum(i)*0.618/len(i)
if len(self.players) > 0:
minabs = abs(self.players[0].getGuess() - self.lastG)
maxabs = abs(self.players[0].getGuess() - self.lastG)
#calculate winner point
for i in self.players[1:]:
#calculate timeouts
if i.getGuess == 0:
i.timeout()
if i.timeoutCount >= 3:
players.remove(i)
continue
if abs(i.getGuess() - self.lastG) < minabs:
self.lastWinner = i.getUsername()
minabs = abs(i.getGuess() - self.lastG)
if abs(i.getGuess() - self.lastG) > maxabs:
maxabs = abs(i.getGuess() - self.lastG)
i.guess = 0
#calculate losers
self.lastLosers = [i.getUsername for i in self.players if abs(i.getGuess() - self.lastG) == maxabs]
#add or minus points
self.roundCount = self.roundCount + 1
for i in self.players:
if i.getUsername() == self.lastWinner:
i.win()
elif i.getUsername() in self.lastLosers:
i.lose()
i.newRound(self.roundTime, self.roundCount)
self.waiting = 1
def newPlayer(self, username, conn):
t = player(username, conn)
self.players.append(t)
return t def getPara(d, p):
if d.has_key(p):
return d[p][0]
return None
def dealWithClient(conn, g):
p = None
while True:
buf = conn.recv(1024)
d = urlparse.parse_qs(buf)
cmd = getPara(d, 'cmd')
if (cmd == 'newplayer'):
username = getPara(d, 'username')
p = g.newPlayer(username, conn)
req = {
'cmd': 'confirmplayer',
'username': username,
'token': p.getToken()
}
sendMsg(conn, urllib.urlencode(req))
elif (cmd == 'submit'):
point = int(getPara(d, 'point'))
print 'submit from ',p.getUsername(), 'point=',point
p.submit(point)
req = {
'cmd': 'confirmsubmit',
'point': point
}
sendMsg(conn, urllib.urlencode(req))
elif (cmd == 'query'):
yourpoint = str(p.getPoint())
lastg = str(g.lastG)
lastwinner = g.lastWinner
req = {
'cmd': 'confirmquery',
'yourpoint': yourpoint,
'lastg': lastg,
'lastwinner': lastwinner
}
sendMsg(conn, urllib.urlencode(req)) def timer(g):
while True:
timeout = g.roundTime
time.sleep(timeout)
g.newRound() if __name__ == '__main__':
g = game()
thread.start_new_thread(timer, (g, ))
sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
sock.bind(('localhost', 9210))
sock.listen(5)
while True:
conn,address = sock.accept()
print 'New client connected.'
thread.start_new_thread(dealWithClient, (conn, g))

server

客户端程序:

# -*- coding: utf-8 -*-

import urllib, urlparse
import thread
import socket
import time class player:
username = ''
token = ''
point = 0
guess = 0
conn = None
timeout = 0
roundCount = 0
def __init__(self, conn):
self.username = ''
self.token = ''
self.point = 0
self.guess = 0
self.conn = conn
def submit(self, guess):
req = {
'cmd': 'submit',
'point': str(guess)
}
self.conn.send(urllib.urlencode(req))
def query(self):
req = {
'cmd': 'query'
}
self.conn.send(urllib.urlencode(req))
def newPlayer(self, username):
req = {
'cmd': 'newplayer',
'username': username
}
self.conn.send(urllib.urlencode(req)) def getPara(d, p):
if d.has_key(p):
return d[p][0]
return None def dealWithServer(conn, p):
while True:
buf = conn.recv(1024)
d = urlparse.parse_qs(buf)
cmd = getPara(d, 'cmd')
if cmd == 'newround':
timeout = getPara(d, 'timeout')
count = getPara(d, 'count')
yourpoint = getPara(d, 'yourpoint')
p.timeout = int(timeout)
p.roundCount = int(count)
p.point = int(yourpoint)
print 'newround, timeout:',timeout
elif cmd == 'confirmplayer':
username = getPara(d, 'username')
token = getPara(d, 'token')
p.username = username
p.token = token
print 'confirmplayer'
elif cmd == 'confirmsubmit':
point = getPara(d, 'point')
p.guess = point
print 'confirm submit'
elif cmd == 'confirmquery':
yourpoint = int(getPara(d, 'yourpoint'))
lastg = getPara(d, 'lastg')
lastwinner = getPara(d, 'lastwinner')
p.point = yourpoint
print 'Query result:\nyourpoint:', yourpoint, '\nlastG:', lastg, '\nlastWinner:', lastwinner, '\n' if __name__ == '__main__':
sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
sock.connect(('localhost', 9210))
p = player(sock)
thread.start_new_thread(dealWithServer, (sock, p))
while True:
time.sleep(1)
print '1. newplayer\n2.submit\n3.query'
cmd = raw_input('choice:')
if cmd == '':
username = raw_input('username:')
p.newPlayer(username)
if cmd == '':
point = raw_input('point:')
p.submit(int(point))
if cmd == '':
p.query()

client

代码还在完善当中,包括用户界面,黄金点曲线等等,有了改动我会继续上传到Github和博客中。

work_5的更多相关文章

  1. Java常用工具类练习题

    1.请根据控制台输入的特定日期格式拆分日期 如:请输入一个日期(格式如:**月**日****年) 经过处理得到:****年**月**日 提示:使用String的方法indexOf.lastIndexO ...

  2. .NET下集中实现AOP编程的框架

    一.Castle 使用这个框架呢,首先是需要安装NuGet包. 先建立一个控制台项目,然后在NuGet中搜索Castle.Windsor,不出意外的话应该能找到如下的包 然后安装,会自动的安装包Cas ...

随机推荐

  1. HDU 2836 Traversal 简单DP + 树状数组

    题意:给你一个序列,问相邻两数高度差绝对值小于等于H的子序列有多少个. dp[i]表示以i为结尾的子序列有多少,易知状态转移方程为:dp[i] = sum( dp[j] ) + 1;( abs( he ...

  2. 9本java程序员必读的书

    来源:http://mp.weixin.qq.com/s?__biz=MjM5NzA1MTcyMA==&mid=202904638&idx=2&sn=21dd20438e32a ...

  3. 在Ubuntu为Android硬件抽象层(HAL)模块编写JNI方法提供Java访问硬件服务接口(老罗学习笔记4)

    在上两篇文章中,我们介绍了如何为Android系统的硬件编写驱动程序,包括如何在Linux内核空间实现内核驱动程序和在用户空间实现硬件抽象层接口.实现这两者的目的是为了向更上一层提供硬件访问接口,即为 ...

  4. unity3d5.2.3中 调整视角

    按住alt键不放,然后左边的手的图标会变成一个眼睛,在Scene中移动.就会发现可以调整视角了

  5. 结构体struct和typedef后面接指针的含义

    typedef struct file { ... }FileInfo, *FileP; 上述程序中定义了一个结构体,结构体的名字为file,并且给其指针 取个别名为FileP,所以后续程序中出现Fi ...

  6. Awesome Javascript(中文翻译版)

    [导读]:GitHub 上有一个 Awesome – XXX 系列的资源整理.awesome-javascript 是 sorrycc 发起维护的 JS 资源列表,内容包括:包管理器.加载器.测试框架 ...

  7. UVa 11076 (有重元素的排列) Add Again

    n个可重复的元素的排列一共有 = All种,其中 假设这些数依次为ai,每种数字有mi个. 从右往左考虑第d位数(d≥0),第i个数字出现的次数为,那么这个数字对所求答案的贡献为 其实可以先一次求出个 ...

  8. Selenium Tutorial (2) - Selenium IDE In Depth

    Installing Firefox and Firebug Installing and Opening Selenium IDE Starting with test cases and test ...

  9. Android、iPhone和Java三个平台一致的加密工具

    先前一直在做安卓,最近要开发iPhone客户端,这其中遇到的最让人纠结的要属Java.Android和iPhone三个平台加解密不一致的问题. 因为手机端后台通常是用JAVA开发的Web Servic ...

  10. HDU 4609 3-idiots (FFT-快速傅立叶变换)

    [题意]给定N个树枝,求从中取出三个可以围成三角形的概率 [思路] 2013多校训练第一场比赛1010题. 一开始就想到了O(n^2)枚举前两个树枝和的算法,赛后群里大牛说计算所有两个树枝和的情况可以 ...