2011/07/30　発表したスライド sourceは、 https://bitbucket.org/tututen/pysap3.1/

1. Python
momo_*( tututen)
1
2011 7 30

2. 2
2011 7 30

3. •
• Python
•
• C
3
2011 7 30

4. ←→ 294km
4
2011 7 30

5. •
•
•
•
5
2011 7 30

6. ATTENTION
6
2011 7 30

7. • PEP8
• Python
• Python
•
7
2011 7 30

8. 8
2011 7 30

9. •
9
2011 7 30

10. •
•
( )
(hatena keyword )
10
2011 7 30

11. •
•
( )
(hatena keyword )
• wiki
11
2011 7 30

12. Python
12
2011 7 30

13. Python
(wikipedia )
13
2011 7 30

14. 14
2011 7 30

15. 15
2011 7 30

16. • range(0, max_value, 2)
16
2011 7 30

17. • range(0, max_value, 2)
• [i * 2 for i in range(num)]
17
2011 7 30

18. • range(0, max_value, 2)
• [i * 2 for i in range(num)]
• a = []
for i in range(num):
a.append(i * 2)
18
2011 7 30

19. 19
2011 7 30

20. 20
2011 7 30

21. 3
21
2011 7 30

22. 3
• OX
•
•
•
•
22
2011 7 30

23. 3
•
•
•
• O or X
•
•
•
• 23
2011 7 30

24. 3
•
•
•
• O or X
•
•
•
• 24
2011 7 30

25. 25
2011 7 30

26. •
• 1 2
•
26
2011 7 30

27. •
• 1 2
‣ 1
•
27
2011 7 30

28. •
• 1 2
‣ 1
•
‣
28
2011 7 30

29. • field = []
for i in range(9):
field.append(‘_‘)
29
2011 7 30

30. • field = []
for i in range(9):
field.append(‘_‘)
• field = [‘_‘ for i in range(9)]
30
2011 7 30

31. • field = []
for i in range(9):
field.append(‘_‘)
• field = [‘_‘ for i in range(9)]
• field = [‘_‘] * 9
31
2011 7 30

32. 3
•
•
•
• O or X
•
•
•
• 32
2011 7 30

33. 33
2011 7 30

34. •
• O or X
‣ −
34
2011 7 30

35. • turn = 1
for x range(3):
for y range(3):
print field[x + y * 3],
print ‘’
if turn == 1:
print ‘o turn’
else :
print ‘x turn’
35
2011 7 30

36. • turn = 1
for x range(3):
for y range(3):
print field[x + y * 3],
print ‘’
if turn == 1:
print ‘o turn’
else :
print ‘x turn’
36
2011 7 30

37. • turn = 1
print “%s%s%s¥n%s%s%s¥n%s%s%s”
% tuple(field)
if turn == 1:
print ‘o turn’
else :
print ‘x turn’
37
2011 7 30

38. • turn = 1
print “%s%s%s¥n%s%s%s¥n%s%s%s”
% tuple(field)
if turn == 1:
print ‘o turn’
else :
print ‘x turn’
38
2011 7 30

39. • turn = 1
print “%s%s%s¥n%s%s%s¥n%s%s%s”
% tuple(field)
marks = ‘_ox’
print ‘%s turn’ % marks[turn]
✴marks[1] == ‘o’
✴marks[-1] == marks[2] == ‘x’
39
2011 7 30

40. 3
•
•
•
• O or X
•
•
•
• 40
2011 7 30

41. 41
2011 7 30

42. • raw_input OK
• int
•
•
0<=x<=2 0<=y<=2
42
2011 7 30

43. • while(True):
try:
x = int(raw_input(‘x(0-2) -> ‘))
y = int(raw_input(‘y(0-2) -> ‘))
except:
continue
if 0 <= x <= 2 and 0 <= y <= 2:
break
43
2011 7 30

44. • while(True):
try:
x = int(raw_input(‘x(0-2) -> ‘))
y = int(raw_input(‘y(0-2) -> ‘))
except:
continue
if 0 <= x <= 2 and 0 <= y <= 2:
break
44
2011 7 30

45. • while(True):
inp = lambda n: raw_input(‘%s(0-2) -> ‘%n)
x, y = inp(‘x’), inp(‘y’)
try:
x = int(x)
y = int(y)
except:
continue
vr = lambda n: 0 <= n <= 2
if vr(x) and vr(y):
break 45
2011 7 30

46. • while(True):
inp = lambda n: raw_input(‘%s(0-2) -> ‘%n)
x, y = inp(‘x’), inp(‘y’)
vr = lambda n: 0 <= n <= 2
if vr(x) and vr(y):
break
try:
x = int(x)
y = int(y)
except:
continue 46
2011 7 30

47. • while(True):
inp = lambda n: raw_input(‘%s(0-2) -> ‘%n)
x, y = inp(‘x’), inp(‘y’)
vr = lambda n: len(n)==1 and ‘0’ <= n <= ‘2’
if vr(x) and vr(y):
break
try:
x = int(x)
y = int(y)
except:
continue 47
2011 7 30

48. • while(True):
inp = lambda n: raw_input(‘%s(0-2) -> ‘%n)
x, y = inp(‘x’), inp(‘y’)
vr = lambda n: len(n)==1 and ‘0’ <= n <= ‘2’
if vr(x) and vr(y):
break
try:
x = int(x)
y = int(y)
except:
continue 48
2011 7 30

49. • while(True):
inp = lambda n: raw_input(‘%s(0-2) -> ‘%n)
x, y = inp(‘x’), inp(‘y’)
vr = lambda n: len(n)==1 and ‘0’ <= n <= ‘2’
if vr(x) and vr(y):
break
x, y = int(x), int(y)
49
2011 7 30

50. • inp = lambda n: raw_input(‘%s(0-2) -> ‘%n)
vr = lambda n: len(n)==1 and ‘0’ <= n <= ‘2’
while(True):
x, y = inp(‘x’), inp(‘y’)
if vr(x) and vr(y):
break
x, y = int(x), int(y)
50
2011 7 30

51. • while(True):
try:
x = int(raw_input(‘x(0-2) -> ‘))
y = int(raw_input(‘y(0-2) -> ‘))
except:
continue
if 0 <= x <= 2 and 0 <= y <= 2:
break
51
2011 7 30

52. • inp = lambda n: raw_input(‘%s(0-2) -> ‘%n)
vr = lambda n: len(n)==1 and ‘0’ <= n <= ‘2’
while(True):
x, y = inp(‘x’), inp(‘y’)
if vr(x) and vr(y):
break
x, y = int(x), int(y)
52
2011 7 30

53. 3
•
•
•
• O or X
•
•
•
• 53
2011 7 30

54. O or X
54
2011 7 30

55. •
•
55
2011 7 30

56. • if field[x + y * 3] != ‘_’:
continue
56
2011 7 30

57. • if field[x + y * 3] != ‘_’:
continue
•
if field[x + y * 3] - ‘_’: continue
57
2011 7 30

58. • if field[x + y * 3] != ‘_’:
continue
•
if field[x + y * 3] - ‘_’: continue
•
58
2011 7 30

59. 3
•
•
•
• O or X
•
•
•
• 59
2011 7 30

60. 60
2011 7 30

61. •8 3
•
61
2011 7 30

62. •8 3
•
•
OX
62
2011 7 30

63. •
0 1 2
3 4 5
6 7 8
63
2011 7 30

64. •
0 1 2
n,n+1,n+2
3 4 5
n,n+3,n+6
6 7 8
????
64
2011 7 30

65. •
0 1 2
n,n+1,n+2
3 4 5
n,n+3,n+6
6 7 8
????
65
2011 7 30

66. •
0 1 2
n,4,8-n
3 4 5
n,n+1,n+2
6 7 8
n,n+3,n+6
66
2011 7 30

67. •
0 1 2
n,4,8-n
3 4 5
n,n+1,n+2
6 7 8
n,n+3,n+6
67
2011 7 30

68. •
n,4,8-n
0 1 2
3 4 5 n,n+1,n+2
6 7 8
n,n+3,n+6
68
2011 7 30

69. • for i in range(3):
if (field[i] != ‘_’ and
field[i] == field[i + 1] and
field[i] == field[i + 2]):
judge = True
if (field[4] != ‘_’ and
field[4] == field[i] and
field[4] == field[8 - i]):
judge = True
...
69
2011 7 30

70. • for i in range(3):
if (field[i] != ‘_’ and
field[i] == field[i + 1] and
field[i] == field[i + 2]):
judge = True
if (field[4] != ‘_’ and
field[4] == field[i] and
field[4] == field[8 - i]):
judge = True
...
70
2011 7 30

71. • mark = ‘ ox’[turn]
for i in range(3):
if [mark]*3 == [field[i], field[i+1],field[i+2]]:
judge = True
if [mark]*3 == [field[i],field[4],field[8-i]]:
judge = True
if [mark]*3 == [field[i], field[i+3],field[i+6]]:
judge = True
...
71
2011 7 30

72. • mark = ‘ ox’[turn]
jl = lambda line: [mark]*3 == line
for i in range(3):
if jl([field[i], field[i+1],field[i+2]]):
judge = True
if jl([field[i],field[4],field[8-i]]):
judge = True
if jl([field[i], field[i+3],field[i+6]]):
judge = True
...
72
2011 7 30

73. • mark = ‘ ox’[turn]
jl = lambda line: [mark]*3 == line
for i in range(3):
if jl([field[i], field[i+1],field[i+2]]):
judge = True
if jl([field[i],field[4],field[8-i]]):
judge = True
if jl([field[i], field[i+3],field[i+6]]):
judge = True
...
73
2011 7 30

74. • mark = ‘ ox’[turn]
jl = lambda line: [mark]*3 == line
for i in range(3):
if jl(field[i*3:i*3+3]):
judge = True
if jl(field[i:9-i:4-i]):
judge = True
if jl(field[i::3]):
judge = True
74
2011 7 30

75. • mark = ‘ ox’[turn]
jl = lambda line: [mark]*3 == line
judge = False
for i in range(3):
judge = judge or jl(field[i*3:i*3+3])
judge = judge or jl(field[i:9-i:4-i])
judge = judge or jl(field[i::3])
75
2011 7 30

76. 3
•
•
•
• O or X
•
•
•
• 76
2011 7 30

77. 77
2011 7 30

78. • for if
78
2011 7 30

79. • for if
• Pythonista
79
2011 7 30

80. • space_flag = False
for val in field:
if val == ‘_’:
space_flag = True
if not space_flag:
break
80
2011 7 30

81. • space_flag = False
for val in field:
if val == ‘_’:
space_flag = True
if not space_flag:
break
81
2011 7 30

82. • space_flag = False
for val in field:
if val == ‘_’:
space_flag = True
if not space_flag:
break
• if not ‘_’ in field:
break
82
2011 7 30

83. 83
2011 7 30

84. •
•
‣ turn*=-1
‣ turn=-turn
84
2011 7 30

85. •
•
‣ turn*=-1
‣ turn=-turn
‣ t*=-1
‣ t=-t
85
2011 7 30

86. 86
2011 7 30

87. • judge
• mark
87
2011 7 30

88. • if judge:
print ‘%s win’ % mark
else:
print ‘draw’
88
2011 7 30

89. • if judge:
print ‘%s win’ % mark
else:
print ‘draw’
• print (‘%s win’ % mark) if judge else ‘draw’
89
2011 7 30

90. • Python
90
2011 7 30

91. • Python
•
91
2011 7 30

92. • Python
•
•
92
2011 7 30

93. Fin
93
2011 7 30