Using F# and genetic programming to play computer bridge
1 like633 views
This document is a presentation slide deck on using domain-specific languages (DSLs) and genetic programming to develop a computer bridge bidding system in F#. It introduces concepts like defining a DSL for representing bridge hands and bids, using genetic programming to evolve rules for evaluating hands and determining bids, and some tips for effective DSL design like keeping the language simple and leveraging language features.
Using F# and genetic programming to play computer bridge
- 1. Women playing bridge in Tallahassee by Florida Memory Project Public Domain Computer Bridge with F#: DSLs and Genetic Programming
- 2. Computer Bridge with F#: DSLs and Genetic Programming @felienne Women playing bridge in Tallahassee by Florida Memory Project Public Domain
- 3. We interrupt the presentation for an important message on SCIENCE
- 4. We interupt the presentation for an important message on SCIENCE
- 6. Computer Bridge with F#: DSLs and Genetic Programming @felienne Women playing bridge in Tallahassee by Florida Memory Project Public Domain
- 7. Omar Sharif bridge by Nationaal Archief (Ron Kroon) CC-BY-SA-3.0
- 8. N S E W Omar Sharif bridge by Nationaal Archief (Ron Kroon) CC-BY-SA-3.0
- 9. 52 cards in 4 suits
- 11. Tricks of four cards 52 cards
- 12. Tricks of four cards 52 cards = 13 tricks
- 13. Trump
- 17. 4 hands
- 20. The basics
- 22. Bidding phase
- 24. BidHand
- 26. Add bids
- 27. Start small, but real DSL Tip #1
- 28. Add bids
- 29. Add bids
- 30. No Trump?!
- 31. Bidding
- 32. Bidding
- 33. Bidding
- 34. Bidding
- 35. SAd
- 36. Two suit types
- 37. Two suit types
- 38. Two suit types
- 39. Two suit types
- 40. Two suit types
- 41. Two suit types
- 42. Duplication
- 51. Add bids
- 52. Does not sound like domain
- 53. Balancing act
- 54. Simple language
- 55. Simple language
- 56. Simple language
- 57. Simple language
- 59. Hand
- 60. BidHand
- 61. BidHand
- 64. Mapping
- 65. Mapping
- 66. Hand
- 67. Hand 4
- 68. Hand 4 1) Max suit length
- 69. Hand
- 71. Hand 4 4 3 2
- 73. Getting a bid
- 74. Getting a bid
- 75. Getting a bid
- 76. Getting a bid
- 77. Getting a bid
- 78. Getting a bid
- 79. Getting a bid
- 81. Getting a bid
- 82. Getting a bid
- 83. Getting a bid
- 84. Getting a bid
- 85. Getting a bid
- 86. Getting a bid
- 87. Getting a bid
- 90. Evaluating a hand Traverse the list until a match
- 92. It takes two
- 93. Hand 4 1) Max suit length
- 95. It takes two
- 96. It takes two
- 97. It takes two
- 98. It takes two
- 99. It takes two
- 100. Read aloud once in a while DSL Tip #4
- 101. Better syntax
- 102. Better syntax
- 103. Better syntax
- 104. Better syntax
- 105. Better syntax
- 106. Better syntax
- 108. We can make it EVEN BETTER!
- 109. Even better!
- 110. Even better!
- 111. Even better!
- 112. Even better!
- 113. Even better!
- 114. Even better!
- 115. Even better!
- 116. Even better!
- 117. Even better!
- 118. Even better!
- 119. Error!
- 120. Let’s read the lang specs!
- 121. Let’s read the lang specs!
- 122. Let’s read the lang specs!
- 123. Let’s read the lang specs! We cannot overload ‘->’
- 124. Let’s read the lang specs!
- 125. Even better!
- 126. Even better!
- 127. Thanks Tomas!!!
- 128. Regularly hang out with Tomas DSL Tip #5
- 129. Regularly hang out with Tomas DSL Tip #5
- 131. It takes two
- 132. It takes three!
- 133. Hand 4 1) Max suit length
- 134. Hand 2) Card value
- 136. It takes three!
- 137. It takes three!
- 139. It takes three!
- 140. It takes three!
- 141. It takes three!
- 142. It takes three!
- 143. It takes three!
- 144. It takes three!
- 145. It takes three!
- 146. Partial application
- 147. Partial application
- 148. Partial application
- 149. Partial application
- 150. Partial application
- 151. Partial application
- 152. Partial application
- 159. Current state
- 160. Current state
- 161. Why a DSL?
- 162. Why a DSL?
- 163. Genetic programming
- 177. Fitness function
- 178. Fitness function
- 186. Mutating plain text not very effective
- 187. Mutate ASTs
- 188. Mutate ASTs if
- 189. DSL = fewer option for AST!
- 195. Let the machines do the thinking
- 198. Let the machines do the thinking
- 199. Let the machines do the thinking
- 200. Let the machines do the thinking
- 201. Let the machines do the thinking
- 204. Let the machines do the thinking
- 205. Let the machines do the thinking
- 206. Let the machines do the thinking
- 207. Let the machines do the thinking
- 208. Let the machines do the thinking
- 209. Not all rules are correct!
- 210. Not all rules are correct! J
- 211. Not all rules are correct! J L
- 212. Not all rules are correct! J L J
- 213. Not all rules are useful! J L J
- 214. Not all rules are useful! J L L
- 215. Remove useless rules
- 216. Remove useless rules
- 217. Remove useless rules
- 218. So little effort!
- 219. Using the rules
- 220. Using the rules
- 221. Using the rules
- 222. Using the rules
- 223. Using the rules
- 224. Bit more exciting!
- 225. Bit more exciting!
- 226. Bit more exciting!
- 227. Bit more exciting!
- 228. Bit more exciting!
- 229. Bit more exciting!
- 230. Bit more exciting!
- 231. Bit more exciting!
- 232. Using the rules
- 233. Using the rules
- 234. Bit more exciting!
- 235. Bit more exciting!
- 236. Bit more exciting!
- 239. Omar Sharif bridge by Nationaal Archief (Ron Kroon) CC-BY-SA-3.0 Next step:
- 240. Mutate this!
- 241. Women playing bridge in Tallahassee by Florida Memory Project Public Domain
- 242. Women playing bridge in Tallahassee by Florida Memory Project Public Domain
- 243. Women playing bridge in Tallahassee by Florida Memory Project Public Domain
- 244. Women playing bridge in Tallahassee by Florida Memory Project Public Domain
- 245. Women playing bridge in Tallahassee by Florida Memory Project Public Domain
- 246. Women playing bridge in Tallahassee by Florida Memory Project Public Domain
- 247. Computer Bridge with F#: DSLs and Genetic Programming @felienne Women playing bridge in Tallahassee by Florida Memory Project Public Domain