{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":36,"n_cols":5,"rows_kept":36,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[9,2,9,3],[9,4,9,5],[10,2,10,3],[10,4,10,5],[11,2,11,3],[12,2,12,3],[13,2,13,3],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[29,2,29,3],[30,2,30,3],[34,2,34,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISOBSOBE00055722"]
[null,null,"Autore",null,"Massillon, Jean Baptiste"]
[null,null,"Titolo",null,"Petit careme de Massillon, eveque de Clermont"]
[null,null,"Pubbl/distr/stampa",null,"A Paris : de l'Imprimerie et de la Fonderie stéréotypes de Pierre Didot l'ainé, et de Firmin Didot, an XI (1803)"]
[null,null,"Edizione",null,"[Édition stéréotype d'après le procédé de Firmin Didot]"]
[null,null,"Descrizione fisica",null,"248 P. ; 24°"]
[null,null,"Lingua di pubblicazione",null,"Francese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNISA996465993603316"]
[null,null,"Titolo",null,"Computers and Games [[electronic resource] ] : 5th International Conference, CG 2006, Turin, Italy, May 29-31, 2006, Revised Papers / / edited by H. Jaap van den Herik, Paolo Ciancarini, H. (Jeroen) H.L. Donkers"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007"]
[null,null,"ISBN",null,"3-540-75538-1"]
[null,null,"Edizione",null,"[1st ed. 2007.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 283 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4630"]
[null,null,"Disciplina",null,"794.81526"]
[null,null,"Soggetti",null,"Computer science"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Mathematical statistics"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer Science"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Probability and Statistics in Computer Science"]
[{"$nulls":4},"Artificial Intelligence"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Includes index."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Computer Analysis of Chess Champions -- Automated Chess Tutor -- A New Heuristic Search Algorithm for Capturing Problems in Go -- An Open Boundary Safety-of-Territory Solver for the Game of Go -- Monte-Carlo Proof-Number Search for Computer Go -- Virtual Global Search: Application to 9×9 Go -- Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search -- Combinatorics of Go -- Abstracting Knowledge from Annotated Chinese-Chess Game Records -- Automatic Strategy Verification for Hex -- Feature Construction for Reinforcement Learning in Hearts -- A Skat Player Based on Monte-Carlo Simulation -- A Retrograde Approximation Algorithm for One-Player Can’t Stop -- Improving Depth-First PN-Search: 1?+?? Trick -- "]
[{"$nulls":4},"Search Versus Knowledge Revisited Again -- Counting the Number of Three-Player Partizan Cold Games -- LUMINES Strategies -- Computing Proper Equilibria of Zero-Sum Games -- Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types -- On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game -- Cheat-Proof Serverless Network Games -- Monte-Carlo Methods in Pool Strategy Game Trees -- Optimization of a Billiard Player – Tactical Play -- Gender and Cultural Differences (If Any!): South African School Children and Computer Games."]